./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/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 17a767ebf51f6a233211ab82288cb9185242fdcf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:50,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:50,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:50,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:50,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:50,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:50,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:50,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:50,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:50,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:50,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:50,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:50,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:50,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:50,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:50,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:50,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:50,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:50,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:50,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:50,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:50,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:50,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:50,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:50,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:50,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:50,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:50,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:50,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:50,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:50,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:50,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:50,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:50,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:50,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:50,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:50,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:50,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:50,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:50,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:50,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:50,843 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:12:50,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:50,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:50,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:50,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:50,861 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:50,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:50,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:50,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:50,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:50,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:50,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:12:50,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:12:50,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:12:50,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:50,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:12:50,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:50,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:12:50,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:50,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:50,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:12:50,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:12:50,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:12:50,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:50,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:12:50,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:12:50,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:12:50,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:12:50,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:12:50,867 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_83b7b94b-bf16-4760-830f-286e4365dcb9/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 -> 17a767ebf51f6a233211ab82288cb9185242fdcf [2019-11-16 00:12:50,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:50,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:50,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:50,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:50,925 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:50,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-11-16 00:12:50,997 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/data/41fc5bbe4/b22c08ada6f44ce1b4f982da76479a88/FLAG155e17d46 [2019-11-16 00:12:51,556 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:51,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-11-16 00:12:51,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/data/41fc5bbe4/b22c08ada6f44ce1b4f982da76479a88/FLAG155e17d46 [2019-11-16 00:12:51,999 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/data/41fc5bbe4/b22c08ada6f44ce1b4f982da76479a88 [2019-11-16 00:12:52,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:52,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:12:52,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:52,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:52,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:52,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:52" (1/1) ... [2019-11-16 00:12:52,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1b2e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:52, skipping insertion in model container [2019-11-16 00:12:52,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:52" (1/1) ... [2019-11-16 00:12:52,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:52,088 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:52,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:52,933 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:53,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:53,211 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:53,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53 WrapperNode [2019-11-16 00:12:53,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:53,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:53,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:12:53,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:12:53,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:53,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:53,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:53,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:53,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... [2019-11-16 00:12:53,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:53,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:53,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:53,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:53,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/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-16 00:12:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:56,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:56,020 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:12:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:56 BoogieIcfgContainer [2019-11-16 00:12:56,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:56,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:12:56,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:12:56,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:12:56,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:52" (1/3) ... [2019-11-16 00:12:56,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3270a2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:56, skipping insertion in model container [2019-11-16 00:12:56,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:53" (2/3) ... [2019-11-16 00:12:56,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3270a2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:56, skipping insertion in model container [2019-11-16 00:12:56,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:56" (3/3) ... [2019-11-16 00:12:56,029 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label57.c [2019-11-16 00:12:56,038 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:12:56,047 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:12:56,055 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:12:56,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:12:56,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:12:56,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:12:56,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:56,086 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:56,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:12:56,087 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:56,087 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:12:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-16 00:12:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-16 00:12:56,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:56,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:12:56,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -10226053, now seen corresponding path program 1 times [2019-11-16 00:12:56,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:56,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141067925] [2019-11-16 00:12:56,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:56,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,744 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-16 00:12:56,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141067925] [2019-11-16 00:12:56,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:56,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:12:56,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864987452] [2019-11-16 00:12:56,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:56,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:56,770 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-16 00:12:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:58,596 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-16 00:12:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:58,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-16 00:12:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:58,618 INFO L225 Difference]: With dead ends: 829 [2019-11-16 00:12:58,618 INFO L226 Difference]: Without dead ends: 463 [2019-11-16 00:12:58,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-16 00:12:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-16 00:12:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-16 00:12:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-16 00:12:58,722 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 161 [2019-11-16 00:12:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:58,725 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-16 00:12:58,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-16 00:12:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:12:58,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:58,738 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:12:58,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1203029931, now seen corresponding path program 1 times [2019-11-16 00:12:58,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:58,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038743526] [2019-11-16 00:12:58,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:58,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:58,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:58,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038743526] [2019-11-16 00:12:58,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:58,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:58,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895673000] [2019-11-16 00:12:58,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:12:58,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:58,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:58,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:58,890 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-16 00:13:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:01,042 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-11-16 00:13:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:01,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:13:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:01,054 INFO L225 Difference]: With dead ends: 1735 [2019-11-16 00:13:01,054 INFO L226 Difference]: Without dead ends: 1288 [2019-11-16 00:13:01,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-16 00:13:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-11-16 00:13:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-16 00:13:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-16 00:13:01,102 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 166 [2019-11-16 00:13:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:01,103 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-16 00:13:01,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-16 00:13:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:13:01,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:01,107 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:01,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -938777153, now seen corresponding path program 1 times [2019-11-16 00:13:01,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:01,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362107969] [2019-11-16 00:13:01,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:01,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:01,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:01,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362107969] [2019-11-16 00:13:01,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:01,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:13:01,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438558748] [2019-11-16 00:13:01,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:01,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:01,237 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-16 00:13:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:01,891 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-16 00:13:01,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:01,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-16 00:13:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:01,896 INFO L225 Difference]: With dead ends: 1695 [2019-11-16 00:13:01,896 INFO L226 Difference]: Without dead ends: 838 [2019-11-16 00:13:01,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-16 00:13:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-16 00:13:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-16 00:13:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-16 00:13:01,931 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 174 [2019-11-16 00:13:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:01,931 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-16 00:13:01,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-16 00:13:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:13:01,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:01,935 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:01,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 133702577, now seen corresponding path program 1 times [2019-11-16 00:13:01,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:01,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087428976] [2019-11-16 00:13:01,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:01,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:13:02,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087428976] [2019-11-16 00:13:02,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:02,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:02,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859398034] [2019-11-16 00:13:02,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:02,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:02,050 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-16 00:13:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:03,861 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-16 00:13:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:03,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:13:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:03,876 INFO L225 Difference]: With dead ends: 3313 [2019-11-16 00:13:03,877 INFO L226 Difference]: Without dead ends: 2477 [2019-11-16 00:13:03,878 INFO L600 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-16 00:13:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-16 00:13:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-16 00:13:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-16 00:13:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-16 00:13:03,927 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 175 [2019-11-16 00:13:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:03,927 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-16 00:13:03,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-16 00:13:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:13:03,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:03,932 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:03,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1756622090, now seen corresponding path program 1 times [2019-11-16 00:13:03,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:03,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106454117] [2019-11-16 00:13:03,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:03,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:03,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:13:04,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106454117] [2019-11-16 00:13:04,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:04,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:13:04,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992124987] [2019-11-16 00:13:04,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:04,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:04,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:04,024 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-16 00:13:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:05,067 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-16 00:13:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:05,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-16 00:13:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:05,087 INFO L225 Difference]: With dead ends: 4133 [2019-11-16 00:13:05,087 INFO L226 Difference]: Without dead ends: 2480 [2019-11-16 00:13:05,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-16 00:13:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-16 00:13:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-16 00:13:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-16 00:13:05,148 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 178 [2019-11-16 00:13:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:05,148 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-16 00:13:05,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-16 00:13:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:13:05,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:05,155 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:05,155 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash -198454923, now seen corresponding path program 1 times [2019-11-16 00:13:05,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:05,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51459738] [2019-11-16 00:13:05,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:05,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:13:05,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51459738] [2019-11-16 00:13:05,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:05,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:13:05,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695591153] [2019-11-16 00:13:05,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:05,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:05,268 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-16 00:13:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:05,839 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-16 00:13:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:05,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-16 00:13:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:05,870 INFO L225 Difference]: With dead ends: 7424 [2019-11-16 00:13:05,870 INFO L226 Difference]: Without dead ends: 4947 [2019-11-16 00:13:05,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-16 00:13:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-16 00:13:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-16 00:13:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-16 00:13:05,990 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 181 [2019-11-16 00:13:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:05,990 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-16 00:13:05,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-16 00:13:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-16 00:13:05,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:05,997 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:05,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1859199098, now seen corresponding path program 1 times [2019-11-16 00:13:05,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:05,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052106534] [2019-11-16 00:13:06,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:06,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:06,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:13:06,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052106534] [2019-11-16 00:13:06,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:06,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:06,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594984441] [2019-11-16 00:13:06,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:06,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:06,086 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-16 00:13:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:07,292 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-16 00:13:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:07,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-16 00:13:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:07,348 INFO L225 Difference]: With dead ends: 14560 [2019-11-16 00:13:07,349 INFO L226 Difference]: Without dead ends: 9617 [2019-11-16 00:13:07,356 INFO L600 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-16 00:13:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-16 00:13:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-16 00:13:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-16 00:13:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12493 transitions. [2019-11-16 00:13:07,541 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12493 transitions. Word has length 183 [2019-11-16 00:13:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:07,542 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12493 transitions. [2019-11-16 00:13:07,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12493 transitions. [2019-11-16 00:13:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:13:07,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:07,554 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:07,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1527292661, now seen corresponding path program 2 times [2019-11-16 00:13:07,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:07,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939678318] [2019-11-16 00:13:07,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:07,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:07,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:13:07,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939678318] [2019-11-16 00:13:07,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:07,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:07,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296642880] [2019-11-16 00:13:07,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:07,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:07,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:07,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:07,642 INFO L87 Difference]: Start difference. First operand 9615 states and 12493 transitions. Second operand 3 states. [2019-11-16 00:13:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:09,020 INFO L93 Difference]: Finished difference Result 26540 states and 34559 transitions. [2019-11-16 00:13:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:09,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-16 00:13:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:09,093 INFO L225 Difference]: With dead ends: 26540 [2019-11-16 00:13:09,093 INFO L226 Difference]: Without dead ends: 16927 [2019-11-16 00:13:09,108 INFO L600 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-16 00:13:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-16 00:13:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-16 00:13:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-16 00:13:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20089 transitions. [2019-11-16 00:13:09,414 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20089 transitions. Word has length 185 [2019-11-16 00:13:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:09,416 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20089 transitions. [2019-11-16 00:13:09,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20089 transitions. [2019-11-16 00:13:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:13:09,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:09,438 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:09,439 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:09,439 INFO L82 PathProgramCache]: Analyzing trace with hash 899468712, now seen corresponding path program 1 times [2019-11-16 00:13:09,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:09,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167761261] [2019-11-16 00:13:09,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:09,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:09,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:13:09,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167761261] [2019-11-16 00:13:09,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:09,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:09,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61099154] [2019-11-16 00:13:09,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:09,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:09,553 INFO L87 Difference]: Start difference. First operand 16923 states and 20089 transitions. Second operand 4 states. [2019-11-16 00:13:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:10,893 INFO L93 Difference]: Finished difference Result 33846 states and 40180 transitions. [2019-11-16 00:13:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:10,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-16 00:13:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:10,928 INFO L225 Difference]: With dead ends: 33846 [2019-11-16 00:13:10,928 INFO L226 Difference]: Without dead ends: 16925 [2019-11-16 00:13:10,947 INFO L600 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-16 00:13:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-11-16 00:13:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-11-16 00:13:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-16 00:13:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19544 transitions. [2019-11-16 00:13:11,264 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19544 transitions. Word has length 203 [2019-11-16 00:13:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:11,265 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19544 transitions. [2019-11-16 00:13:11,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19544 transitions. [2019-11-16 00:13:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-16 00:13:11,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:11,284 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:11,285 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -361443703, now seen corresponding path program 1 times [2019-11-16 00:13:11,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:11,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193042587] [2019-11-16 00:13:11,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:11,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:11,628 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-11-16 00:13:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:13:11,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193042587] [2019-11-16 00:13:11,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:11,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:13:11,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481735796] [2019-11-16 00:13:11,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:13:11,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:13:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:11,678 INFO L87 Difference]: Start difference. First operand 16923 states and 19544 transitions. Second operand 5 states. [2019-11-16 00:13:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:13,760 INFO L93 Difference]: Finished difference Result 77631 states and 89804 transitions. [2019-11-16 00:13:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:13:13,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2019-11-16 00:13:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:13,848 INFO L225 Difference]: With dead ends: 77631 [2019-11-16 00:13:13,848 INFO L226 Difference]: Without dead ends: 60710 [2019-11-16 00:13:13,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60710 states. [2019-11-16 00:13:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60710 to 60704. [2019-11-16 00:13:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60704 states. [2019-11-16 00:13:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60704 states to 60704 states and 70206 transitions. [2019-11-16 00:13:15,007 INFO L78 Accepts]: Start accepts. Automaton has 60704 states and 70206 transitions. Word has length 228 [2019-11-16 00:13:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:15,008 INFO L462 AbstractCegarLoop]: Abstraction has 60704 states and 70206 transitions. [2019-11-16 00:13:15,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:13:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 60704 states and 70206 transitions. [2019-11-16 00:13:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-16 00:13:15,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:15,029 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:15,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1215433345, now seen corresponding path program 1 times [2019-11-16 00:13:15,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:15,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114878124] [2019-11-16 00:13:15,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:15,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:15,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:15,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114878124] [2019-11-16 00:13:15,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:15,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:15,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949645758] [2019-11-16 00:13:15,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:15,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:15,162 INFO L87 Difference]: Start difference. First operand 60704 states and 70206 transitions. Second operand 3 states. [2019-11-16 00:13:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:16,619 INFO L93 Difference]: Finished difference Result 143587 states and 166565 transitions. [2019-11-16 00:13:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:16,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-16 00:13:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:16,703 INFO L225 Difference]: With dead ends: 143587 [2019-11-16 00:13:16,704 INFO L226 Difference]: Without dead ends: 82885 [2019-11-16 00:13:16,741 INFO L600 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-16 00:13:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82885 states. [2019-11-16 00:13:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82885 to 82831. [2019-11-16 00:13:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82831 states. [2019-11-16 00:13:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82831 states to 82831 states and 95030 transitions. [2019-11-16 00:13:18,407 INFO L78 Accepts]: Start accepts. Automaton has 82831 states and 95030 transitions. Word has length 231 [2019-11-16 00:13:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:18,407 INFO L462 AbstractCegarLoop]: Abstraction has 82831 states and 95030 transitions. [2019-11-16 00:13:18,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 82831 states and 95030 transitions. [2019-11-16 00:13:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-16 00:13:18,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:18,429 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:18,429 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1616179030, now seen corresponding path program 1 times [2019-11-16 00:13:18,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:18,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854888878] [2019-11-16 00:13:18,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:18,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:18,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:13:18,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854888878] [2019-11-16 00:13:18,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003498125] [2019-11-16 00:13:18,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/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-16 00:13:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:18,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:13:18,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:13:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:13:18,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:13:18,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:13:18,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174496304] [2019-11-16 00:13:18,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:18,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:18,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:18,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:18,984 INFO L87 Difference]: Start difference. First operand 82831 states and 95030 transitions. Second operand 3 states. [2019-11-16 00:13:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:20,884 INFO L93 Difference]: Finished difference Result 161604 states and 185369 transitions. [2019-11-16 00:13:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:20,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-16 00:13:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:20,969 INFO L225 Difference]: With dead ends: 161604 [2019-11-16 00:13:20,969 INFO L226 Difference]: Without dead ends: 78775 [2019-11-16 00:13:21,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78775 states. [2019-11-16 00:13:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78775 to 72876. [2019-11-16 00:13:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72876 states. [2019-11-16 00:13:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72876 states to 72876 states and 81916 transitions. [2019-11-16 00:13:21,790 INFO L78 Accepts]: Start accepts. Automaton has 72876 states and 81916 transitions. Word has length 239 [2019-11-16 00:13:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:21,790 INFO L462 AbstractCegarLoop]: Abstraction has 72876 states and 81916 transitions. [2019-11-16 00:13:21,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 72876 states and 81916 transitions. [2019-11-16 00:13:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-16 00:13:21,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:21,811 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:13:22,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:22,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1709211579, now seen corresponding path program 1 times [2019-11-16 00:13:22,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:22,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644544477] [2019-11-16 00:13:22,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:22,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:22,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:22,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644544477] [2019-11-16 00:13:22,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:22,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:13:22,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994781890] [2019-11-16 00:13:22,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:22,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:22,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:22,211 INFO L87 Difference]: Start difference. First operand 72876 states and 81916 transitions. Second operand 3 states. [2019-11-16 00:13:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:23,469 INFO L93 Difference]: Finished difference Result 164423 states and 185526 transitions. [2019-11-16 00:13:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:23,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-16 00:13:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:23,578 INFO L225 Difference]: With dead ends: 164423 [2019-11-16 00:13:23,578 INFO L226 Difference]: Without dead ends: 91549 [2019-11-16 00:13:24,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:13:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91549 states. [2019-11-16 00:13:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91549 to 91549. [2019-11-16 00:13:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91549 states. [2019-11-16 00:13:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91549 states to 91549 states and 100388 transitions. [2019-11-16 00:13:25,270 INFO L78 Accepts]: Start accepts. Automaton has 91549 states and 100388 transitions. Word has length 272 [2019-11-16 00:13:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:25,271 INFO L462 AbstractCegarLoop]: Abstraction has 91549 states and 100388 transitions. [2019-11-16 00:13:25,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 91549 states and 100388 transitions. [2019-11-16 00:13:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-11-16 00:13:25,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:25,286 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:25,286 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1997086450, now seen corresponding path program 1 times [2019-11-16 00:13:25,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:25,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424714225] [2019-11-16 00:13:25,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:25,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:25,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-16 00:13:25,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424714225] [2019-11-16 00:13:25,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630191360] [2019-11-16 00:13:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/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-16 00:13:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:25,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:13:25,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:13:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-16 00:13:25,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:13:25,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-16 00:13:25,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23606596] [2019-11-16 00:13:25,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:25,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:13:25,828 INFO L87 Difference]: Start difference. First operand 91549 states and 100388 transitions. Second operand 3 states. [2019-11-16 00:13:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:27,458 INFO L93 Difference]: Finished difference Result 268117 states and 293771 transitions. [2019-11-16 00:13:27,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:27,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-11-16 00:13:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:27,643 INFO L225 Difference]: With dead ends: 268117 [2019-11-16 00:13:27,643 INFO L226 Difference]: Without dead ends: 176570 [2019-11-16 00:13:27,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:13:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176570 states. [2019-11-16 00:13:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176570 to 176566. [2019-11-16 00:13:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176566 states. [2019-11-16 00:13:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176566 states to 176566 states and 193374 transitions. [2019-11-16 00:13:29,433 INFO L78 Accepts]: Start accepts. Automaton has 176566 states and 193374 transitions. Word has length 329 [2019-11-16 00:13:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:29,434 INFO L462 AbstractCegarLoop]: Abstraction has 176566 states and 193374 transitions. [2019-11-16 00:13:29,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 176566 states and 193374 transitions. [2019-11-16 00:13:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-16 00:13:29,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:29,476 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:13:29,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:29,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:29,680 INFO L82 PathProgramCache]: Analyzing trace with hash -731096947, now seen corresponding path program 1 times [2019-11-16 00:13:29,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:29,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442725343] [2019-11-16 00:13:29,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:29,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:29,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-16 00:13:33,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442725343] [2019-11-16 00:13:33,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:33,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:33,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118718739] [2019-11-16 00:13:33,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:33,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:33,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:33,560 INFO L87 Difference]: Start difference. First operand 176566 states and 193374 transitions. Second operand 4 states. [2019-11-16 00:13:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:35,557 INFO L93 Difference]: Finished difference Result 359920 states and 393955 transitions. [2019-11-16 00:13:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:35,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-11-16 00:13:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:35,759 INFO L225 Difference]: With dead ends: 359920 [2019-11-16 00:13:35,759 INFO L226 Difference]: Without dead ends: 183356 [2019-11-16 00:13:35,830 INFO L600 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-16 00:13:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183356 states. [2019-11-16 00:13:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183356 to 176160. [2019-11-16 00:13:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176160 states. [2019-11-16 00:13:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176160 states to 176160 states and 192548 transitions. [2019-11-16 00:13:38,150 INFO L78 Accepts]: Start accepts. Automaton has 176160 states and 192548 transitions. Word has length 387 [2019-11-16 00:13:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:38,150 INFO L462 AbstractCegarLoop]: Abstraction has 176160 states and 192548 transitions. [2019-11-16 00:13:38,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 176160 states and 192548 transitions. [2019-11-16 00:13:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-16 00:13:38,199 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:38,200 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:38,200 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1850717027, now seen corresponding path program 1 times [2019-11-16 00:13:38,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:38,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806367252] [2019-11-16 00:13:38,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:38,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:38,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-16 00:13:38,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806367252] [2019-11-16 00:13:38,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:38,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:38,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127007247] [2019-11-16 00:13:38,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:38,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:38,459 INFO L87 Difference]: Start difference. First operand 176160 states and 192548 transitions. Second operand 4 states. [2019-11-16 00:13:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:40,573 INFO L93 Difference]: Finished difference Result 361734 states and 395668 transitions. [2019-11-16 00:13:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:40,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-16 00:13:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:40,764 INFO L225 Difference]: With dead ends: 361734 [2019-11-16 00:13:40,764 INFO L226 Difference]: Without dead ends: 185576 [2019-11-16 00:13:40,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185576 states. [2019-11-16 00:13:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185576 to 172114. [2019-11-16 00:13:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172114 states. [2019-11-16 00:13:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172114 states to 172114 states and 188084 transitions. [2019-11-16 00:13:43,922 INFO L78 Accepts]: Start accepts. Automaton has 172114 states and 188084 transitions. Word has length 408 [2019-11-16 00:13:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:43,922 INFO L462 AbstractCegarLoop]: Abstraction has 172114 states and 188084 transitions. [2019-11-16 00:13:43,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 172114 states and 188084 transitions. [2019-11-16 00:13:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-16 00:13:43,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:43,956 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:13:43,956 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 613897899, now seen corresponding path program 1 times [2019-11-16 00:13:43,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:43,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003135935] [2019-11-16 00:13:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:43,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 146 proven. 3 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-16 00:13:44,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003135935] [2019-11-16 00:13:44,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550474598] [2019-11-16 00:13:44,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:44,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:13:44,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:13:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-16 00:13:44,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:13:44,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:13:44,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289506780] [2019-11-16 00:13:44,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:44,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:13:44,642 INFO L87 Difference]: Start difference. First operand 172114 states and 188084 transitions. Second operand 3 states. [2019-11-16 00:13:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:47,229 INFO L93 Difference]: Finished difference Result 341404 states and 372971 transitions. [2019-11-16 00:13:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-16 00:13:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:47,232 INFO L225 Difference]: With dead ends: 341404 [2019-11-16 00:13:47,232 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:13:47,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:13:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:13:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:13:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:13:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:13:47,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 420 [2019-11-16 00:13:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:47,334 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:13:47,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:13:47,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:13:47,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:47,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:13:54,487 WARN L191 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-11-16 00:13:58,807 WARN L191 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-11-16 00:14:04,485 WARN L191 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 378 DAG size of output: 79 [2019-11-16 00:14:10,236 WARN L191 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 378 DAG size of output: 79 [2019-11-16 00:14:10,237 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:14:10,237 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,238 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,239 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-16 00:14:10,240 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,241 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,242 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,243 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,244 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,245 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,246 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-16 00:14:10,247 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,248 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-16 00:14:10,249 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-16 00:14:10,250 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-16 00:14:10,251 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,251 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,251 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,253 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse7 (= ~a12~0 1))) (let ((.cse6 (= 1 ~a6~0)) (.cse5 (= ~a27~0 1)) (.cse11 (not .cse7))) (let ((.cse0 (and .cse5 .cse11)) (.cse20 (not .cse6)) (.cse1 (= ~a5~0 1))) (let ((.cse16 (= ~a13~0 1)) (.cse15 (and .cse0 .cse20 .cse1)) (.cse4 (<= ~a3~0 0)) (.cse13 (and .cse20 .cse1)) (.cse14 (<= 2 ~a3~0)) (.cse2 (= ~a11~0 1)) (.cse18 (not (= ~a7~0 1))) (.cse17 (= 1 ~a10~0)) (.cse3 (<= ~a26~0 0)) (.cse12 (= ~a16~0 1)) (.cse19 (and .cse11 .cse20 .cse1)) (.cse8 (= 1 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse2) (and .cse8 .cse6 .cse9 .cse1 .cse10) (and .cse11 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse10 .cse12 .cse13) (and .cse9 .cse0 .cse3 .cse1) (and .cse8 .cse6 .cse0 .cse1 .cse2) (and .cse11 .cse8 .cse1 .cse2 .cse10) (and .cse6 .cse0 .cse1 .cse2 .cse12) (and .cse14 .cse5 .cse9 .cse1 .cse10) (and .cse15 .cse14 .cse2 .cse10) (and .cse11 .cse14 .cse6 .cse9 .cse3 .cse1) (and .cse8 .cse2 .cse10 .cse13) (and .cse5 .cse7 .cse9 .cse1 .cse10) (and .cse4 .cse6 .cse1 .cse2 .cse10) (and .cse14 .cse5 .cse1 .cse2 .cse10 .cse12) (and .cse16 .cse11 .cse6 .cse1 .cse2 .cse10) (and .cse11 .cse6 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse2 .cse10 .cse12 .cse13) (and .cse4 .cse5 .cse17 .cse7 .cse1 .cse2 .cse10) (and .cse16 .cse8 .cse6 .cse3 .cse1 .cse2 .cse12) (and .cse18 .cse5 .cse6 .cse17 .cse1 .cse2 .cse12) (and .cse4 .cse18 .cse17 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse1 .cse12) (and .cse11 .cse1 .cse2 .cse10 .cse12) (and .cse17 .cse2 .cse10 .cse12 .cse13) (and .cse14 .cse9 .cse1 .cse10 .cse12) (and .cse19 .cse8 .cse17 .cse9 .cse3) (and .cse4 .cse6 .cse17 .cse0 .cse1 .cse2) (and .cse18 .cse14 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse5 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse9 .cse10 .cse13) (and .cse14 .cse5 .cse9 .cse3 .cse13) (and .cse15 .cse17 .cse9 .cse10) (and .cse18 .cse8 .cse6 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse17 .cse2 .cse10 .cse13) (and .cse5 .cse17 .cse1 .cse2 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse13) (and .cse5 .cse2 .cse10 .cse12 .cse13) (and .cse19 .cse14 .cse3 .cse2) (and .cse18 .cse6 .cse17 .cse9 .cse3 .cse1 .cse12) (and .cse19 .cse8 .cse9 .cse10)))))) [2019-11-16 00:14:10,253 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,254 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,255 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,256 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,257 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,258 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,258 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,258 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,258 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,259 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse7 (= ~a12~0 1))) (let ((.cse6 (= 1 ~a6~0)) (.cse5 (= ~a27~0 1)) (.cse11 (not .cse7))) (let ((.cse0 (and .cse5 .cse11)) (.cse20 (not .cse6)) (.cse1 (= ~a5~0 1))) (let ((.cse16 (= ~a13~0 1)) (.cse15 (and .cse0 .cse20 .cse1)) (.cse4 (<= ~a3~0 0)) (.cse13 (and .cse20 .cse1)) (.cse14 (<= 2 ~a3~0)) (.cse2 (= ~a11~0 1)) (.cse18 (not (= ~a7~0 1))) (.cse17 (= 1 ~a10~0)) (.cse3 (<= ~a26~0 0)) (.cse12 (= ~a16~0 1)) (.cse19 (and .cse11 .cse20 .cse1)) (.cse8 (= 1 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse2) (and .cse8 .cse6 .cse9 .cse1 .cse10) (and .cse11 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse10 .cse12 .cse13) (and .cse9 .cse0 .cse3 .cse1) (and .cse8 .cse6 .cse0 .cse1 .cse2) (and .cse11 .cse8 .cse1 .cse2 .cse10) (and .cse6 .cse0 .cse1 .cse2 .cse12) (and .cse14 .cse5 .cse9 .cse1 .cse10) (and .cse15 .cse14 .cse2 .cse10) (and .cse11 .cse14 .cse6 .cse9 .cse3 .cse1) (and .cse8 .cse2 .cse10 .cse13) (and .cse5 .cse7 .cse9 .cse1 .cse10) (and .cse4 .cse6 .cse1 .cse2 .cse10) (and .cse14 .cse5 .cse1 .cse2 .cse10 .cse12) (and .cse16 .cse11 .cse6 .cse1 .cse2 .cse10) (and .cse11 .cse6 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse2 .cse10 .cse12 .cse13) (and .cse4 .cse5 .cse17 .cse7 .cse1 .cse2 .cse10) (and .cse16 .cse8 .cse6 .cse3 .cse1 .cse2 .cse12) (and .cse18 .cse5 .cse6 .cse17 .cse1 .cse2 .cse12) (and .cse4 .cse18 .cse17 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse1 .cse12) (and .cse11 .cse1 .cse2 .cse10 .cse12) (and .cse17 .cse2 .cse10 .cse12 .cse13) (and .cse14 .cse9 .cse1 .cse10 .cse12) (and .cse19 .cse8 .cse17 .cse9 .cse3) (and .cse4 .cse6 .cse17 .cse0 .cse1 .cse2) (and .cse18 .cse14 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse5 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse9 .cse10 .cse13) (and .cse14 .cse5 .cse9 .cse3 .cse13) (and .cse15 .cse17 .cse9 .cse10) (and .cse18 .cse8 .cse6 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse17 .cse2 .cse10 .cse13) (and .cse5 .cse17 .cse1 .cse2 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse13) (and .cse5 .cse2 .cse10 .cse12 .cse13) (and .cse19 .cse14 .cse3 .cse2) (and .cse18 .cse6 .cse17 .cse9 .cse3 .cse1 .cse12) (and .cse19 .cse8 .cse9 .cse10)))))) [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:14:10,260 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-16 00:14:10,261 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,262 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,263 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1518) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:14:10,264 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:14:10,265 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,266 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-16 00:14:10,267 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-16 00:14:10,267 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-16 00:14:10,268 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,268 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,268 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,268 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,269 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,270 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:14:10,270 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:14:10,272 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,272 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,273 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,273 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-16 00:14:10,273 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-16 00:14:10,273 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,275 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,276 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-16 00:14:10,277 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,278 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-16 00:14:10,279 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-16 00:14:10,280 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-16 00:14:10,281 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,281 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-16 00:14:10,281 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-16 00:14:10,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:14:10 BoogieIcfgContainer [2019-11-16 00:14:10,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:14:10,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:14:10,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:14:10,348 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:14:10,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:56" (3/4) ... [2019-11-16 00:14:10,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:14:10,391 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:14:10,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:14:10,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_83b7b94b-bf16-4760-830f-286e4365dcb9/bin/uautomizer/witness.graphml [2019-11-16 00:14:10,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:14:10,641 INFO L168 Benchmark]: Toolchain (without parser) took 78638.92 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 942.0 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,641 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:10,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1209.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,642 INFO L168 Benchmark]: Boogie Preprocessor took 129.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,643 INFO L168 Benchmark]: RCFGBuilder took 2511.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,643 INFO L168 Benchmark]: TraceAbstraction took 74324.77 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,644 INFO L168 Benchmark]: Witness Printer took 292.59 ms. Allocated memory is still 5.1 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 75.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:10,646 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1209.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2511.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.1 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74324.77 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 292.59 ms. Allocated memory is still 5.1 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 75.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1518]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 <= 0) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || ((((1 == a3 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((1 == a6 && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 2 <= a3) && 1 == a6) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((1 == a3 && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a13 == 1 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((2 <= a3 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a6) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || ((((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a10 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && 1 == a6) && 1 == a10) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((((!(a7 == 1) && 2 <= a3) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((2 <= a3 && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) && a26 == 1)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((2 <= a3 && 1 == a10) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a26 <= 0) && a11 == 1)) || ((((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 <= 0) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || ((((1 == a3 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((1 == a6 && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 2 <= a3) && 1 == a6) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((1 == a3 && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a13 == 1 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((2 <= a3 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a6) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || ((((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a10 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && 1 == a6) && 1 == a10) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((((!(a7 == 1) && 2 <= a3) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((2 <= a3 && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) && a26 == 1)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((2 <= a3 && 1 == a10) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a26 <= 0) && a11 == 1)) || ((((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 74.1s, OverallIterations: 17, TraceHistogramMax: 7, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.6s, HoareTripleCheckerStatistics: 3031 SDtfs, 5702 SDslu, 1478 SDs, 0 SdLazy, 10453 SolverSat, 2075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176566occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 27897 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1559 NumberOfFragments, 1687 HoareAnnotationTreeSize, 3 FomulaSimplifications, 55110 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 27976 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5088 ConstructedInterpolants, 0 QuantifiedInterpolants, 2521650 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1793 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 3042/3051 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...