./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.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_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/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 28b1d24b851fc193321d917a51d82cffe4d9ea6e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:21:44,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:21:44,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:21:44,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:21:44,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:21:44,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:21:44,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:21:44,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:21:44,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:21:44,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:21:44,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:21:44,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:21:44,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:21:45,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:21:45,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:21:45,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:21:45,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:21:45,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:21:45,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:21:45,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:21:45,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:21:45,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:21:45,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:21:45,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:21:45,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:21:45,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:21:45,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:21:45,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:21:45,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:21:45,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:21:45,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:21:45,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:21:45,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:21:45,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:21:45,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:21:45,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:21:45,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:21:45,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:21:45,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:21:45,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:21:45,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:21:45,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:21:45,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:21:45,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:21:45,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:21:45,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:21:45,043 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:21:45,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:21:45,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:21:45,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:21:45,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:21:45,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:21:45,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:21:45,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:21:45,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:21:45,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:21:45,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:21:45,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:21:45,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:21:45,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:21:45,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:21:45,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:21:45,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:21:45,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:21:45,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:21:45,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:21:45,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:21:45,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:21:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:21:45,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:21:45,049 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_9961dffc-24f3-41c1-b678-782135f457d3/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 -> 28b1d24b851fc193321d917a51d82cffe4d9ea6e [2019-11-15 21:21:45,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:21:45,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:21:45,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:21:45,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:21:45,100 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:21:45,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-15 21:21:45,167 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/data/941c7cb59/b7f0620d7f7b44f6bae8b3f52f82b3af/FLAG122e62cfb [2019-11-15 21:21:45,805 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:21:45,806 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-15 21:21:45,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/data/941c7cb59/b7f0620d7f7b44f6bae8b3f52f82b3af/FLAG122e62cfb [2019-11-15 21:21:46,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/data/941c7cb59/b7f0620d7f7b44f6bae8b3f52f82b3af [2019-11-15 21:21:46,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:21:46,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:21:46,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:46,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:21:46,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:21:46,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:46" (1/1) ... [2019-11-15 21:21:46,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226dc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:46, skipping insertion in model container [2019-11-15 21:21:46,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:46" (1/1) ... [2019-11-15 21:21:46,072 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:21:46,178 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:21:47,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:47,037 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:21:47,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:47,543 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:21:47,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47 WrapperNode [2019-11-15 21:21:47,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:47,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:47,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:21:47,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:21:47,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:47,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:21:47,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:21:47,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:21:47,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... [2019-11-15 21:21:47,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:21:47,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:21:47,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:21:47,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:21:47,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:21:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:21:47,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:21:50,589 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:21:50,589 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:21:50,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:50 BoogieIcfgContainer [2019-11-15 21:21:50,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:21:50,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:21:50,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:21:50,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:21:50,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:21:46" (1/3) ... [2019-11-15 21:21:50,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ac8c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:50, skipping insertion in model container [2019-11-15 21:21:50,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:47" (2/3) ... [2019-11-15 21:21:50,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ac8c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:50, skipping insertion in model container [2019-11-15 21:21:50,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:50" (3/3) ... [2019-11-15 21:21:50,604 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label32.c [2019-11-15 21:21:50,615 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:21:50,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:21:50,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:21:50,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:21:50,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:21:50,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:21:50,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:21:50,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:21:50,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:21:50,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:21:50,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:21:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 21:21:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 21:21:50,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:50,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:50,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -570388181, now seen corresponding path program 1 times [2019-11-15 21:21:50,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:50,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687739857] [2019-11-15 21:21:50,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:50,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:50,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:51,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687739857] [2019-11-15 21:21:51,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:51,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:51,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434207986] [2019-11-15 21:21:51,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:51,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:51,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:51,609 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-15 21:21:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:54,131 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-15 21:21:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:54,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 21:21:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:54,157 INFO L225 Difference]: With dead ends: 1075 [2019-11-15 21:21:54,157 INFO L226 Difference]: Without dead ends: 677 [2019-11-15 21:21:54,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-15 21:21:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-15 21:21:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-15 21:21:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-15 21:21:54,294 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 189 [2019-11-15 21:21:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:54,300 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-15 21:21:54,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-15 21:21:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 21:21:54,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:54,311 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:54,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash -811782164, now seen corresponding path program 1 times [2019-11-15 21:21:54,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:54,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205922515] [2019-11-15 21:21:54,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:54,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:54,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205922515] [2019-11-15 21:21:54,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:54,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:21:54,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477354789] [2019-11-15 21:21:54,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:21:54,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:21:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:21:54,559 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-15 21:21:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:55,765 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-15 21:21:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:21:55,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-15 21:21:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:55,773 INFO L225 Difference]: With dead ends: 1323 [2019-11-15 21:21:55,773 INFO L226 Difference]: Without dead ends: 874 [2019-11-15 21:21:55,775 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-15 21:21:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-15 21:21:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-15 21:21:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 21:21:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-15 21:21:55,810 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 197 [2019-11-15 21:21:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:55,811 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-15 21:21:55,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:21:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-15 21:21:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 21:21:55,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:55,816 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:55,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash -104919451, now seen corresponding path program 1 times [2019-11-15 21:21:55,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:55,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135682089] [2019-11-15 21:21:55,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:55,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:55,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:55,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135682089] [2019-11-15 21:21:55,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:55,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:55,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2966950] [2019-11-15 21:21:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:55,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:55,923 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-15 21:21:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:58,127 INFO L93 Difference]: Finished difference Result 3364 states and 5170 transitions. [2019-11-15 21:21:58,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:58,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 21:21:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:58,145 INFO L225 Difference]: With dead ends: 3364 [2019-11-15 21:21:58,145 INFO L226 Difference]: Without dead ends: 2507 [2019-11-15 21:21:58,147 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-15 21:21:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-11-15 21:21:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1682. [2019-11-15 21:21:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-15 21:21:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-11-15 21:21:58,220 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 198 [2019-11-15 21:21:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:58,220 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-11-15 21:21:58,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-11-15 21:21:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 21:21:58,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:58,228 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:58,228 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash 48899105, now seen corresponding path program 1 times [2019-11-15 21:21:58,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:58,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330632733] [2019-11-15 21:21:58,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:58,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:58,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:21:58,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330632733] [2019-11-15 21:21:58,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:58,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:21:58,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386435750] [2019-11-15 21:21:58,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:58,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:58,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:58,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:58,545 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 4 states. [2019-11-15 21:22:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:00,636 INFO L93 Difference]: Finished difference Result 6614 states and 9588 transitions. [2019-11-15 21:22:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:22:00,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 21:22:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:00,676 INFO L225 Difference]: With dead ends: 6614 [2019-11-15 21:22:00,676 INFO L226 Difference]: Without dead ends: 4934 [2019-11-15 21:22:00,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:22:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-15 21:22:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-15 21:22:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-15 21:22:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6537 transitions. [2019-11-15 21:22:00,813 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6537 transitions. Word has length 204 [2019-11-15 21:22:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:00,814 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 6537 transitions. [2019-11-15 21:22:00,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:22:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6537 transitions. [2019-11-15 21:22:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 21:22:00,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:00,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:00,830 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1217776380, now seen corresponding path program 1 times [2019-11-15 21:22:00,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:00,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575877911] [2019-11-15 21:22:00,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:00,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:00,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:22:01,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575877911] [2019-11-15 21:22:01,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:01,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:22:01,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243691502] [2019-11-15 21:22:01,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:01,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:22:01,126 INFO L87 Difference]: Start difference. First operand 4932 states and 6537 transitions. Second operand 3 states. [2019-11-15 21:22:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:02,489 INFO L93 Difference]: Finished difference Result 11905 states and 15682 transitions. [2019-11-15 21:22:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:02,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 21:22:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:02,535 INFO L225 Difference]: With dead ends: 11905 [2019-11-15 21:22:02,536 INFO L226 Difference]: Without dead ends: 6975 [2019-11-15 21:22:02,543 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-15 21:22:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2019-11-15 21:22:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6974. [2019-11-15 21:22:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-15 21:22:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8983 transitions. [2019-11-15 21:22:02,706 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8983 transitions. Word has length 230 [2019-11-15 21:22:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:02,706 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8983 transitions. [2019-11-15 21:22:02,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8983 transitions. [2019-11-15 21:22:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-15 21:22:02,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:02,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:02,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1656032921, now seen corresponding path program 1 times [2019-11-15 21:22:02,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:02,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616385992] [2019-11-15 21:22:02,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:22:03,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616385992] [2019-11-15 21:22:03,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690683952] [2019-11-15 21:22:03,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:22:03,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:22:03,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:22:03,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 21:22:03,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368004522] [2019-11-15 21:22:03,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:03,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:03,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:03,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:22:03,320 INFO L87 Difference]: Start difference. First operand 6974 states and 8983 transitions. Second operand 3 states. [2019-11-15 21:22:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:04,883 INFO L93 Difference]: Finished difference Result 13963 states and 17998 transitions. [2019-11-15 21:22:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:04,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-11-15 21:22:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:04,927 INFO L225 Difference]: With dead ends: 13963 [2019-11-15 21:22:04,928 INFO L226 Difference]: Without dead ends: 6991 [2019-11-15 21:22:04,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 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-15 21:22:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2019-11-15 21:22:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6974. [2019-11-15 21:22:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-15 21:22:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8848 transitions. [2019-11-15 21:22:05,103 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8848 transitions. Word has length 237 [2019-11-15 21:22:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:05,103 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8848 transitions. [2019-11-15 21:22:05,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8848 transitions. [2019-11-15 21:22:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 21:22:05,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:05,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:05,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:05,333 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1468503162, now seen corresponding path program 1 times [2019-11-15 21:22:05,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:05,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441977331] [2019-11-15 21:22:05,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:05,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:05,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:22:05,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441977331] [2019-11-15 21:22:05,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:05,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:05,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476840830] [2019-11-15 21:22:05,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:22:05,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:22:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:22:05,616 INFO L87 Difference]: Start difference. First operand 6974 states and 8848 transitions. Second operand 4 states. [2019-11-15 21:22:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:07,448 INFO L93 Difference]: Finished difference Result 17239 states and 21713 transitions. [2019-11-15 21:22:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:22:07,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 21:22:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:07,490 INFO L225 Difference]: With dead ends: 17239 [2019-11-15 21:22:07,490 INFO L226 Difference]: Without dead ends: 10267 [2019-11-15 21:22:07,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:22:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2019-11-15 21:22:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 8206. [2019-11-15 21:22:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-11-15 21:22:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 10221 transitions. [2019-11-15 21:22:07,662 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 10221 transitions. Word has length 252 [2019-11-15 21:22:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:07,663 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 10221 transitions. [2019-11-15 21:22:07,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:22:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 10221 transitions. [2019-11-15 21:22:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 21:22:07,685 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:07,685 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:07,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1641424082, now seen corresponding path program 1 times [2019-11-15 21:22:07,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:07,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652117298] [2019-11-15 21:22:07,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:07,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:07,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 21:22:07,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652117298] [2019-11-15 21:22:07,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:07,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:07,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139105968] [2019-11-15 21:22:07,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:22:07,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:07,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:22:07,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:22:07,926 INFO L87 Difference]: Start difference. First operand 8206 states and 10221 transitions. Second operand 4 states. [2019-11-15 21:22:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:09,498 INFO L93 Difference]: Finished difference Result 29430 states and 36498 transitions. [2019-11-15 21:22:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:22:09,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-15 21:22:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:09,541 INFO L225 Difference]: With dead ends: 29430 [2019-11-15 21:22:09,541 INFO L226 Difference]: Without dead ends: 21226 [2019-11-15 21:22:09,554 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-15 21:22:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2019-11-15 21:22:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 14503. [2019-11-15 21:22:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14503 states. [2019-11-15 21:22:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14503 states to 14503 states and 17335 transitions. [2019-11-15 21:22:09,824 INFO L78 Accepts]: Start accepts. Automaton has 14503 states and 17335 transitions. Word has length 254 [2019-11-15 21:22:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:09,825 INFO L462 AbstractCegarLoop]: Abstraction has 14503 states and 17335 transitions. [2019-11-15 21:22:09,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:22:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 14503 states and 17335 transitions. [2019-11-15 21:22:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-15 21:22:09,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:09,866 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:09,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -590016379, now seen corresponding path program 1 times [2019-11-15 21:22:09,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:09,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299073547] [2019-11-15 21:22:09,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:09,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:09,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-15 21:22:10,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299073547] [2019-11-15 21:22:10,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766401512] [2019-11-15 21:22:10,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:10,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:22:10,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:22:10,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:22:10,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 21:22:10,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868471826] [2019-11-15 21:22:10,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:10,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:10,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:22:10,510 INFO L87 Difference]: Start difference. First operand 14503 states and 17335 transitions. Second operand 3 states. [2019-11-15 21:22:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:11,310 INFO L93 Difference]: Finished difference Result 28767 states and 34387 transitions. [2019-11-15 21:22:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:11,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-15 21:22:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:11,365 INFO L225 Difference]: With dead ends: 28767 [2019-11-15 21:22:11,367 INFO L226 Difference]: Without dead ends: 14266 [2019-11-15 21:22:11,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 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-15 21:22:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14266 states. [2019-11-15 21:22:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14266 to 13251. [2019-11-15 21:22:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-15 21:22:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15809 transitions. [2019-11-15 21:22:11,742 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15809 transitions. Word has length 330 [2019-11-15 21:22:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:11,743 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15809 transitions. [2019-11-15 21:22:11,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15809 transitions. [2019-11-15 21:22:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-15 21:22:11,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:11,801 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:12,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:12,014 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash 106936724, now seen corresponding path program 1 times [2019-11-15 21:22:12,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:12,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471953608] [2019-11-15 21:22:12,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:12,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:12,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 21:22:12,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471953608] [2019-11-15 21:22:12,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054448073] [2019-11-15 21:22:12,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:12,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:22:12,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:22:12,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:22:12,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 21:22:12,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816298844] [2019-11-15 21:22:12,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:12,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:22:12,727 INFO L87 Difference]: Start difference. First operand 13251 states and 15809 transitions. Second operand 3 states. [2019-11-15 21:22:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:13,787 INFO L93 Difference]: Finished difference Result 26503 states and 31621 transitions. [2019-11-15 21:22:13,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:13,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-11-15 21:22:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:13,809 INFO L225 Difference]: With dead ends: 26503 [2019-11-15 21:22:13,810 INFO L226 Difference]: Without dead ends: 13254 [2019-11-15 21:22:13,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:22:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13254 states. [2019-11-15 21:22:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13254 to 13251. [2019-11-15 21:22:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-15 21:22:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15155 transitions. [2019-11-15 21:22:14,018 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15155 transitions. Word has length 346 [2019-11-15 21:22:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:14,019 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15155 transitions. [2019-11-15 21:22:14,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15155 transitions. [2019-11-15 21:22:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-11-15 21:22:14,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:14,051 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:14,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:14,256 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1570706907, now seen corresponding path program 1 times [2019-11-15 21:22:14,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:14,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739728372] [2019-11-15 21:22:14,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:14,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:14,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:22:14,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739728372] [2019-11-15 21:22:14,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:14,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:14,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838717779] [2019-11-15 21:22:14,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:14,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:22:14,826 INFO L87 Difference]: Start difference. First operand 13251 states and 15155 transitions. Second operand 3 states. [2019-11-15 21:22:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:15,979 INFO L93 Difference]: Finished difference Result 26501 states and 30310 transitions. [2019-11-15 21:22:15,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:15,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-11-15 21:22:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:15,998 INFO L225 Difference]: With dead ends: 26501 [2019-11-15 21:22:15,998 INFO L226 Difference]: Without dead ends: 13252 [2019-11-15 21:22:16,007 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-15 21:22:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2019-11-15 21:22:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 13251. [2019-11-15 21:22:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-15 21:22:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 14735 transitions. [2019-11-15 21:22:16,190 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 14735 transitions. Word has length 394 [2019-11-15 21:22:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:16,191 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 14735 transitions. [2019-11-15 21:22:16,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 14735 transitions. [2019-11-15 21:22:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 21:22:16,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:16,210 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:16,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1164857076, now seen corresponding path program 1 times [2019-11-15 21:22:16,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:16,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203674315] [2019-11-15 21:22:16,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:16,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:16,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 21:22:16,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203674315] [2019-11-15 21:22:16,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:16,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:16,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077652283] [2019-11-15 21:22:16,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:16,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:16,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:22:16,507 INFO L87 Difference]: Start difference. First operand 13251 states and 14735 transitions. Second operand 3 states. [2019-11-15 21:22:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:17,478 INFO L93 Difference]: Finished difference Result 26300 states and 29259 transitions. [2019-11-15 21:22:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:17,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-15 21:22:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:17,496 INFO L225 Difference]: With dead ends: 26300 [2019-11-15 21:22:17,497 INFO L226 Difference]: Without dead ends: 13051 [2019-11-15 21:22:17,505 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-15 21:22:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2019-11-15 21:22:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12439. [2019-11-15 21:22:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12439 states. [2019-11-15 21:22:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 13550 transitions. [2019-11-15 21:22:17,673 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 13550 transitions. Word has length 421 [2019-11-15 21:22:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:17,673 INFO L462 AbstractCegarLoop]: Abstraction has 12439 states and 13550 transitions. [2019-11-15 21:22:17,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 13550 transitions. [2019-11-15 21:22:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-15 21:22:17,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:17,690 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:17,691 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1167417895, now seen corresponding path program 1 times [2019-11-15 21:22:17,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:17,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183880197] [2019-11-15 21:22:17,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:17,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:17,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-15 21:22:18,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183880197] [2019-11-15 21:22:18,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:18,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:18,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28769573] [2019-11-15 21:22:18,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:18,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:18,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:22:18,310 INFO L87 Difference]: Start difference. First operand 12439 states and 13550 transitions. Second operand 3 states. [2019-11-15 21:22:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:19,263 INFO L93 Difference]: Finished difference Result 29966 states and 32694 transitions. [2019-11-15 21:22:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:19,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-15 21:22:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:19,280 INFO L225 Difference]: With dead ends: 29966 [2019-11-15 21:22:19,280 INFO L226 Difference]: Without dead ends: 17529 [2019-11-15 21:22:19,287 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-15 21:22:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2019-11-15 21:22:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13657. [2019-11-15 21:22:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-11-15 21:22:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 14892 transitions. [2019-11-15 21:22:19,478 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 14892 transitions. Word has length 443 [2019-11-15 21:22:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:19,479 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 14892 transitions. [2019-11-15 21:22:19,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 14892 transitions. [2019-11-15 21:22:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-15 21:22:19,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:19,497 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:19,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1549945789, now seen corresponding path program 1 times [2019-11-15 21:22:19,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:19,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937799646] [2019-11-15 21:22:19,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:19,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 263 proven. 14 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-15 21:22:19,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937799646] [2019-11-15 21:22:19,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709209806] [2019-11-15 21:22:19,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:20,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:22:20,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-15 21:22:20,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:22:20,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 21:22:20,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896006857] [2019-11-15 21:22:20,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:20,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:22:20,306 INFO L87 Difference]: Start difference. First operand 13657 states and 14892 transitions. Second operand 3 states. [2019-11-15 21:22:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:20,868 INFO L93 Difference]: Finished difference Result 38502 states and 41959 transitions. [2019-11-15 21:22:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:20,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-11-15 21:22:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:20,902 INFO L225 Difference]: With dead ends: 38502 [2019-11-15 21:22:20,902 INFO L226 Difference]: Without dead ends: 24847 [2019-11-15 21:22:20,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 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-15 21:22:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24847 states. [2019-11-15 21:22:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24847 to 24847. [2019-11-15 21:22:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24847 states. [2019-11-15 21:22:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24847 states to 24847 states and 26857 transitions. [2019-11-15 21:22:21,426 INFO L78 Accepts]: Start accepts. Automaton has 24847 states and 26857 transitions. Word has length 453 [2019-11-15 21:22:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:21,427 INFO L462 AbstractCegarLoop]: Abstraction has 24847 states and 26857 transitions. [2019-11-15 21:22:21,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24847 states and 26857 transitions. [2019-11-15 21:22:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-11-15 21:22:21,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:21,457 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:21,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:21,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash -852721927, now seen corresponding path program 1 times [2019-11-15 21:22:21,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:21,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368215773] [2019-11-15 21:22:21,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:21,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:21,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 21:22:22,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368215773] [2019-11-15 21:22:22,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:22:22,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:22:22,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42548591] [2019-11-15 21:22:22,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:22:22,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:22:22,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:22:22,158 INFO L87 Difference]: Start difference. First operand 24847 states and 26857 transitions. Second operand 3 states. [2019-11-15 21:22:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:23,081 INFO L93 Difference]: Finished difference Result 54783 states and 59135 transitions. [2019-11-15 21:22:23,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:22:23,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 455 [2019-11-15 21:22:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:23,083 INFO L225 Difference]: With dead ends: 54783 [2019-11-15 21:22:23,083 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:22:23,101 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-15 21:22:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:22:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:22:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:22:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:22:23,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 455 [2019-11-15 21:22:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:23,103 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:22:23,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:22:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:22:23,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:22:23,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:22:24,166 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 373 DAG size of output: 325 [2019-11-15 21:22:24,978 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 325 [2019-11-15 21:22:27,659 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 323 DAG size of output: 54 [2019-11-15 21:22:29,904 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 323 DAG size of output: 54 [2019-11-15 21:22:29,906 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 21:22:29,906 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 21:22:29,907 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,908 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,909 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,910 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,911 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 21:22:29,912 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,913 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,914 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,915 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,916 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,919 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,919 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 21:22:29,919 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,920 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 21:22:29,921 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,922 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,923 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,923 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0))) (let ((.cse4 (not (= ~a12~0 1))) (.cse13 (not .cse3)) (.cse0 (not (= 1 ~a11~0))) (.cse7 (= ~a27~0 1)) (.cse8 (= ~a5~0 1))) (let ((.cse6 (= 0 ~a3~0)) (.cse12 (and .cse0 .cse7 .cse8)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a11~0 1)) (.cse10 (not (= 1 ~a3~0))) (.cse11 (<= ~a3~0 1)) (.cse14 (and .cse4 .cse13)) (.cse1 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse1) (and .cse2 .cse6 .cse5 .cse1) (and .cse7 .cse8 .cse9 .cse5) (and (and .cse0 .cse7 .cse10) .cse2) (and .cse11 (not .cse5) .cse2 .cse3 .cse1) (and .cse2 (and .cse0 .cse6 .cse1)) (and (<= ~a10~0 0) .cse12 .cse5) (and .cse0 (and .cse7 .cse4 .cse8)) (and .cse7 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse5 .cse1 .cse13) (and .cse3 .cse12 .cse5) (and (and .cse1 .cse13 .cse10) .cse2 .cse5) (and .cse2 .cse9 .cse14 .cse1 .cse10) (and .cse11 .cse2 (and .cse0 .cse14 .cse1)) (and .cse2 (and .cse4 .cse7 .cse13)))))) [2019-11-15 21:22:29,924 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,924 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,924 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,924 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 21:22:29,924 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,925 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 21:22:29,926 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,927 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,928 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,929 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 21:22:29,929 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 21:22:29,929 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,929 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0))) (let ((.cse4 (not (= ~a12~0 1))) (.cse13 (not .cse3)) (.cse0 (not (= 1 ~a11~0))) (.cse7 (= ~a27~0 1)) (.cse8 (= ~a5~0 1))) (let ((.cse6 (= 0 ~a3~0)) (.cse12 (and .cse0 .cse7 .cse8)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a11~0 1)) (.cse10 (not (= 1 ~a3~0))) (.cse11 (<= ~a3~0 1)) (.cse14 (and .cse4 .cse13)) (.cse1 (<= ~a27~0 0)) (.cse2 (= 1 ~a5~0))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse1) (and .cse2 .cse6 .cse5 .cse1) (and .cse7 .cse8 .cse9 .cse5) (and (and .cse0 .cse7 .cse10) .cse2) (and .cse11 (not .cse5) .cse2 .cse3 .cse1) (and .cse2 (and .cse0 .cse6 .cse1)) (and (<= ~a10~0 0) .cse12 .cse5) (and .cse0 (and .cse7 .cse4 .cse8)) (and .cse7 .cse3 .cse8 .cse10) (and .cse2 .cse9 .cse5 .cse1 .cse13) (and .cse3 .cse12 .cse5) (and (and .cse1 .cse13 .cse10) .cse2 .cse5) (and .cse2 .cse9 .cse14 .cse1 .cse10) (and .cse11 .cse2 (and .cse0 .cse14 .cse1)) (and .cse2 (and .cse4 .cse7 .cse13)))))) [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 21:22:29,930 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,931 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,932 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,933 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 21:22:29,934 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,935 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 21:22:29,936 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,937 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,938 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 21:22:29,939 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 21:22:29,940 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 21:22:29,941 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,942 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 21:22:29,943 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,944 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1602) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,945 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 21:22:29,946 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 21:22:29,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:22:29 BoogieIcfgContainer [2019-11-15 21:22:29,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:22:29,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:22:29,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:22:29,978 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:22:29,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:50" (3/4) ... [2019-11-15 21:22:29,982 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:22:30,020 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:22:30,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:22:30,280 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9961dffc-24f3-41c1-b678-782135f457d3/bin/uautomizer/witness.graphml [2019-11-15 21:22:30,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:22:30,282 INFO L168 Benchmark]: Toolchain (without parser) took 44238.40 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -500.9 MB). Peak memory consumption was 942.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,282 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:22:30,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1497.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -109.2 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.73 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,283 INFO L168 Benchmark]: Boogie Preprocessor took 112.83 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,284 INFO L168 Benchmark]: RCFGBuilder took 2796.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -181.5 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,285 INFO L168 Benchmark]: TraceAbstraction took 39385.67 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -310.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,285 INFO L168 Benchmark]: Witness Printer took 302.55 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:30,287 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1497.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -109.2 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.73 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.83 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2796.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -181.5 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39385.67 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -310.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 302.55 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1602]: 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: (((((((((((((((((!(1 == a11) && a27 <= 0) && 1 == a5) && 1 == a6) || (((!(a12 == 1) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((!(1 == a11) && a27 == 1) && !(1 == a3)) && 1 == a5)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (1 == a5 && (!(1 == a11) && 0 == a3) && a27 <= 0)) || ((a10 <= 0 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || (!(1 == a11) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && 1 == a6) && a5 == 1) && !(1 == a3))) || ((((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0) && !(1 == a6))) || ((1 == a6 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a27 <= 0 && !(1 == a6)) && !(1 == a3)) && 1 == a5) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || ((a3 <= 1 && 1 == a5) && (!(1 == a11) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (1 == a5 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == a11) && a27 <= 0) && 1 == a5) && 1 == a6) || (((!(a12 == 1) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((!(1 == a11) && a27 == 1) && !(1 == a3)) && 1 == a5)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (1 == a5 && (!(1 == a11) && 0 == a3) && a27 <= 0)) || ((a10 <= 0 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || (!(1 == a11) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((a27 == 1 && 1 == a6) && a5 == 1) && !(1 == a3))) || ((((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0) && !(1 == a6))) || ((1 == a6 && (!(1 == a11) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((a27 <= 0 && !(1 == a6)) && !(1 == a3)) && 1 == a5) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || ((a3 <= 1 && 1 == a5) && (!(1 == a11) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (1 == a5 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 39.2s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, HoareTripleCheckerStatistics: 3282 SDtfs, 3603 SDslu, 690 SDs, 0 SdLazy, 11041 SolverSat, 2003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1416 GetRequests, 1378 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24847occurred 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: 2.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 15373 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 300 NumberOfFragments, 539 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7358 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 31384 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 5969 NumberOfCodeBlocks, 5969 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5950 ConstructedInterpolants, 0 QuantifiedInterpolants, 3769545 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 3763/3786 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...