./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc86a08ff37d05adddb13279399a852f6ece83c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:57:46,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:57:46,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:57:46,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:57:46,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:57:46,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:57:46,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:57:46,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:57:46,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:57:46,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:57:46,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:57:46,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:57:46,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:57:46,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:57:46,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:57:46,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:57:46,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:57:46,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:57:46,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:57:46,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:57:46,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:57:46,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:57:46,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:57:46,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:57:46,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:57:46,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:57:46,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:57:46,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:57:46,074 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:57:46,075 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:57:46,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:57:46,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:57:46,075 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:57:46,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:57:46,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:57:46,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:57:46,077 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 08:57:46,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:57:46,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:57:46,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:57:46,087 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:57:46,087 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:57:46,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:57:46,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:57:46,088 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:57:46,088 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:57:46,088 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:57:46,088 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:57:46,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:57:46,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:57:46,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:57:46,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:57:46,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:57:46,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:57:46,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:57:46,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:57:46,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:57:46,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:57:46,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:57:46,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:57:46,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 08:57:46,092 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan 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 -> Taipan 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 -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-11-10 08:57:46,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:57:46,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:57:46,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:57:46,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:57:46,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:57:46,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-10 08:57:46,159 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/data/81d5cf24e/8466b04e6fb440f1bfeb59c5546e6b6f/FLAGa287d542c [2018-11-10 08:57:46,571 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:57:46,572 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-10 08:57:46,576 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/data/81d5cf24e/8466b04e6fb440f1bfeb59c5546e6b6f/FLAGa287d542c [2018-11-10 08:57:46,586 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/data/81d5cf24e/8466b04e6fb440f1bfeb59c5546e6b6f [2018-11-10 08:57:46,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:57:46,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:57:46,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:57:46,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:57:46,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:57:46,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46, skipping insertion in model container [2018-11-10 08:57:46,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:57:46,620 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:57:46,716 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:57:46,718 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:57:46,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:57:46,741 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:57:46,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46 WrapperNode [2018-11-10 08:57:46,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:57:46,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:57:46,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:57:46,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:57:46,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:57:46,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:57:46,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:57:46,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:57:46,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... [2018-11-10 08:57:46,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:57:46,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:57:46,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:57:46,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:57:46,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/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 [2018-11-10 08:57:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:57:46,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:57:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:57:46,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:57:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:57:46,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:57:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 08:57:46,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 08:57:46,979 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:57:46,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:57:46 BoogieIcfgContainer [2018-11-10 08:57:46,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:57:46,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:57:46,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:57:46,982 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:57:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:57:46" (1/3) ... [2018-11-10 08:57:46,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2463c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:46, skipping insertion in model container [2018-11-10 08:57:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:46" (2/3) ... [2018-11-10 08:57:46,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2463c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:46, skipping insertion in model container [2018-11-10 08:57:46,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:57:46" (3/3) ... [2018-11-10 08:57:46,985 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-10 08:57:46,993 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:57:46,998 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:57:47,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:57:47,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:57:47,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:57:47,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:57:47,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:57:47,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:57:47,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:57:47,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:57:47,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:57:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-10 08:57:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:57:47,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:47,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:47,058 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:47,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-11-10 08:57:47,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:47,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:57:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:57:47,151 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:47,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 08:57:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:57:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:57:47,163 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-10 08:57:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:47,180 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-11-10 08:57:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:57:47,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-10 08:57:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:47,187 INFO L225 Difference]: With dead ends: 83 [2018-11-10 08:57:47,187 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 08:57:47,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:57:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 08:57:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 08:57:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 08:57:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-11-10 08:57:47,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-11-10 08:57:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:47,219 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-10 08:57:47,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 08:57:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-10 08:57:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:57:47,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:47,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:47,221 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:47,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-11-10 08:57:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:47,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:57:47,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:57:47,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:47,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:57:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:57:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:57:47,302 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-11-10 08:57:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:47,488 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-11-10 08:57:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:57:47,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:57:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:47,489 INFO L225 Difference]: With dead ends: 77 [2018-11-10 08:57:47,489 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 08:57:47,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:57:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 08:57:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-11-10 08:57:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 08:57:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-11-10 08:57:47,501 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-11-10 08:57:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:47,501 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-10 08:57:47,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:57:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-11-10 08:57:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:57:47,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:47,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:47,502 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:47,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-11-10 08:57:47,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:57:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:57:47,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:47,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:57:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:57:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:57:47,578 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-11-10 08:57:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:47,704 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-10 08:57:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:57:47,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 08:57:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:47,706 INFO L225 Difference]: With dead ends: 121 [2018-11-10 08:57:47,706 INFO L226 Difference]: Without dead ends: 119 [2018-11-10 08:57:47,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:57:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-10 08:57:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-11-10 08:57:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 08:57:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-11-10 08:57:47,725 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-11-10 08:57:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:47,725 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-11-10 08:57:47,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:57:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-11-10 08:57:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 08:57:47,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:47,726 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:47,726 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:47,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-11-10 08:57:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:47,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:47,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:47,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:47,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 08:57:47,793 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-11-10 08:57:47,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:47,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:47,920 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:47,947 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:57:47,948 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-10 08:57:47,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:47,955 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:57:48,026 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-11-10 08:57:48,026 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:57:48,107 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-10 08:57:48,107 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:57:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-10 08:57:48,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:48,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:57:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:57:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:57:48,109 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 10 states. [2018-11-10 08:57:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:49,548 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2018-11-10 08:57:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:57:49,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-10 08:57:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:49,550 INFO L225 Difference]: With dead ends: 294 [2018-11-10 08:57:49,550 INFO L226 Difference]: Without dead ends: 292 [2018-11-10 08:57:49,552 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:57:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-10 08:57:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249. [2018-11-10 08:57:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-10 08:57:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 398 transitions. [2018-11-10 08:57:49,596 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 398 transitions. Word has length 21 [2018-11-10 08:57:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:49,597 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 398 transitions. [2018-11-10 08:57:49,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:57:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 398 transitions. [2018-11-10 08:57:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 08:57:49,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:49,598 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:49,599 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:49,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1032051649, now seen corresponding path program 1 times [2018-11-10 08:57:49,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:49,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:49,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:49,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:49,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:49,673 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 08:57:49,673 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [69], [84], [87], [89], [92], [94], [95], [96], [97], [119], [120], [121] [2018-11-10 08:57:49,674 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:49,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:49,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:49,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:49,688 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-10 08:57:49,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:49,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:49,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:49,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:49,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:49,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:49,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:57:49,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:49,924 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:49,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-11-10 08:57:49,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:49,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:57:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:57:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:57:49,925 INFO L87 Difference]: Start difference. First operand 249 states and 398 transitions. Second operand 5 states. [2018-11-10 08:57:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:50,225 INFO L93 Difference]: Finished difference Result 552 states and 895 transitions. [2018-11-10 08:57:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:57:50,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-10 08:57:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:50,231 INFO L225 Difference]: With dead ends: 552 [2018-11-10 08:57:50,231 INFO L226 Difference]: Without dead ends: 388 [2018-11-10 08:57:50,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:57:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-10 08:57:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 297. [2018-11-10 08:57:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-10 08:57:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 477 transitions. [2018-11-10 08:57:50,290 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 477 transitions. Word has length 21 [2018-11-10 08:57:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:50,290 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 477 transitions. [2018-11-10 08:57:50,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:57:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 477 transitions. [2018-11-10 08:57:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 08:57:50,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:50,293 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:50,293 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:50,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1772370613, now seen corresponding path program 1 times [2018-11-10 08:57:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:50,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:57:50,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:50,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:50,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 08:57:50,348 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-11-10 08:57:50,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:50,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:50,353 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:50,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:57:50,363 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-10 08:57:50,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:50,368 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:57:50,390 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-11-10 08:57:50,390 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:57:50,438 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-10 08:57:50,438 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:57:50,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-10 08:57:50,438 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:50,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:57:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:57:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:57:50,439 INFO L87 Difference]: Start difference. First operand 297 states and 477 transitions. Second operand 9 states. [2018-11-10 08:57:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:51,473 INFO L93 Difference]: Finished difference Result 502 states and 796 transitions. [2018-11-10 08:57:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:57:51,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-10 08:57:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:51,475 INFO L225 Difference]: With dead ends: 502 [2018-11-10 08:57:51,475 INFO L226 Difference]: Without dead ends: 397 [2018-11-10 08:57:51,476 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:57:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-10 08:57:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2018-11-10 08:57:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-10 08:57:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 611 transitions. [2018-11-10 08:57:51,515 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 611 transitions. Word has length 21 [2018-11-10 08:57:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:51,516 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 611 transitions. [2018-11-10 08:57:51,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:57:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 611 transitions. [2018-11-10 08:57:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 08:57:51,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:51,517 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:51,517 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:51,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-11-10 08:57:51,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:51,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:51,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:51,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 08:57:51,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:51,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:51,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 08:57:51,564 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-11-10 08:57:51,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:51,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:51,569 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:51,578 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:57:51,578 INFO L272 AbstractInterpreter]: Visited 23 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:51,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:51,579 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:57:51,601 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 75.64% of their original sizes. [2018-11-10 08:57:51,601 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:57:51,672 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-10 08:57:51,672 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:57:51,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:51,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-10 08:57:51,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:51,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:57:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:57:51,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:57:51,674 INFO L87 Difference]: Start difference. First operand 385 states and 611 transitions. Second operand 12 states. [2018-11-10 08:57:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:53,141 INFO L93 Difference]: Finished difference Result 463 states and 731 transitions. [2018-11-10 08:57:53,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 08:57:53,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-10 08:57:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:53,143 INFO L225 Difference]: With dead ends: 463 [2018-11-10 08:57:53,143 INFO L226 Difference]: Without dead ends: 461 [2018-11-10 08:57:53,143 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:57:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-10 08:57:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 399. [2018-11-10 08:57:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 08:57:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 632 transitions. [2018-11-10 08:57:53,185 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 632 transitions. Word has length 28 [2018-11-10 08:57:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:53,185 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 632 transitions. [2018-11-10 08:57:53,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:57:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 632 transitions. [2018-11-10 08:57:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 08:57:53,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:53,186 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:53,186 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1497639215, now seen corresponding path program 1 times [2018-11-10 08:57:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:53,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 08:57:53,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:53,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:53,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 08:57:53,242 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-11-10 08:57:53,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:53,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:53,246 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:53,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:53,255 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:53,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:53,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:53,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:53,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:53,272 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:53,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:57:53,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:57:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:53,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-10 08:57:53,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:53,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:57:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:57:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:57:53,369 INFO L87 Difference]: Start difference. First operand 399 states and 632 transitions. Second operand 6 states. [2018-11-10 08:57:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:53,592 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2018-11-10 08:57:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:57:53,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-10 08:57:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:53,596 INFO L225 Difference]: With dead ends: 727 [2018-11-10 08:57:53,596 INFO L226 Difference]: Without dead ends: 725 [2018-11-10 08:57:53,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:57:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-10 08:57:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 628. [2018-11-10 08:57:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-10 08:57:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1028 transitions. [2018-11-10 08:57:53,666 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1028 transitions. Word has length 28 [2018-11-10 08:57:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:53,666 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 1028 transitions. [2018-11-10 08:57:53,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:57:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1028 transitions. [2018-11-10 08:57:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 08:57:53,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:53,668 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:53,668 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:53,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-11-10 08:57:53,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:53,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:57:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:53,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:53,720 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-10 08:57:53,720 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105] [2018-11-10 08:57:53,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:53,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:53,724 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:53,732 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:57:53,732 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-10 08:57:53,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:53,733 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:57:53,751 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 77.67% of their original sizes. [2018-11-10 08:57:53,751 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:57:53,809 INFO L415 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2018-11-10 08:57:53,809 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:57:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-10 08:57:53,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:53,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:57:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:57:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:57:53,810 INFO L87 Difference]: Start difference. First operand 628 states and 1028 transitions. Second operand 10 states. [2018-11-10 08:57:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:54,823 INFO L93 Difference]: Finished difference Result 672 states and 1091 transitions. [2018-11-10 08:57:54,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:57:54,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-10 08:57:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:54,826 INFO L225 Difference]: With dead ends: 672 [2018-11-10 08:57:54,826 INFO L226 Difference]: Without dead ends: 670 [2018-11-10 08:57:54,827 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:57:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-10 08:57:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 632. [2018-11-10 08:57:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-10 08:57:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1031 transitions. [2018-11-10 08:57:54,926 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1031 transitions. Word has length 31 [2018-11-10 08:57:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:54,926 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 1031 transitions. [2018-11-10 08:57:54,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:57:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1031 transitions. [2018-11-10 08:57:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 08:57:54,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:54,927 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:54,928 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:54,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-11-10 08:57:54,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:54,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:54,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:54,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:57:54,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:54,970 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:54,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-10 08:57:54,971 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-11-10 08:57:54,972 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:54,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:54,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:54,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:54,992 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:54,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:54,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:54,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:54,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:55,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:55,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:55,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:57:55,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:57:55,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:57:55,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-11-10 08:57:55,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:57:55,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 08:57:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:57:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:57:55,307 INFO L87 Difference]: Start difference. First operand 632 states and 1031 transitions. Second operand 14 states. [2018-11-10 08:57:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:56,216 INFO L93 Difference]: Finished difference Result 981 states and 1602 transitions. [2018-11-10 08:57:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:57:56,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-10 08:57:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:56,220 INFO L225 Difference]: With dead ends: 981 [2018-11-10 08:57:56,220 INFO L226 Difference]: Without dead ends: 979 [2018-11-10 08:57:56,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:57:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-11-10 08:57:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 893. [2018-11-10 08:57:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-10 08:57:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1461 transitions. [2018-11-10 08:57:56,340 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1461 transitions. Word has length 33 [2018-11-10 08:57:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:56,340 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1461 transitions. [2018-11-10 08:57:56,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 08:57:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1461 transitions. [2018-11-10 08:57:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 08:57:56,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:56,341 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:56,342 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:56,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-11-10 08:57:56,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:56,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:57:56,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:56,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:56,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-10 08:57:56,398 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-11-10 08:57:56,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:56,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:56,402 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:56,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:56,410 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:56,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:56,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:56,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:56,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:56,440 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:56,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 08:57:56,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 08:57:56,625 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:56,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-11-10 08:57:56,625 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:56,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 08:57:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:57:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:57:56,626 INFO L87 Difference]: Start difference. First operand 893 states and 1461 transitions. Second operand 8 states. [2018-11-10 08:57:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:56,888 INFO L93 Difference]: Finished difference Result 953 states and 1541 transitions. [2018-11-10 08:57:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:57:56,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-10 08:57:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:56,892 INFO L225 Difference]: With dead ends: 953 [2018-11-10 08:57:56,892 INFO L226 Difference]: Without dead ends: 951 [2018-11-10 08:57:56,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-10 08:57:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-11-10 08:57:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 899. [2018-11-10 08:57:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-11-10 08:57:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1459 transitions. [2018-11-10 08:57:56,987 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1459 transitions. Word has length 33 [2018-11-10 08:57:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:56,988 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1459 transitions. [2018-11-10 08:57:56,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 08:57:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1459 transitions. [2018-11-10 08:57:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 08:57:56,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:56,989 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:56,989 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:56,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-11-10 08:57:56,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:56,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:56,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:56,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:56,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 08:57:57,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:57,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:57,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-10 08:57:57,044 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-11-10 08:57:57,045 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:57,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:57,048 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:57,059 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:57:57,059 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:57,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:57,067 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:57:57,093 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 79.08% of their original sizes. [2018-11-10 08:57:57,093 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:57:57,161 INFO L415 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-11-10 08:57:57,161 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:57:57,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:57,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-11-10 08:57:57,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:57,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 08:57:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:57:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:57:57,162 INFO L87 Difference]: Start difference. First operand 899 states and 1459 transitions. Second operand 12 states. [2018-11-10 08:57:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:58,722 INFO L93 Difference]: Finished difference Result 984 states and 1581 transitions. [2018-11-10 08:57:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 08:57:58,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-10 08:57:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:58,725 INFO L225 Difference]: With dead ends: 984 [2018-11-10 08:57:58,725 INFO L226 Difference]: Without dead ends: 982 [2018-11-10 08:57:58,726 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-10 08:57:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-11-10 08:57:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 888. [2018-11-10 08:57:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-10 08:57:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1427 transitions. [2018-11-10 08:57:58,829 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1427 transitions. Word has length 43 [2018-11-10 08:57:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:58,830 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1427 transitions. [2018-11-10 08:57:58,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 08:57:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1427 transitions. [2018-11-10 08:57:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 08:57:58,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:58,831 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:57:58,831 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:58,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1887033901, now seen corresponding path program 1 times [2018-11-10 08:57:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:58,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:58,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 08:57:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:58,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:58,883 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-10 08:57:58,883 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-11-10 08:57:58,884 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:58,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:58,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:58,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:58,920 INFO L272 AbstractInterpreter]: Visited 30 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 08:57:58,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:58,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:58,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:58,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:58,939 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:58,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 08:57:58,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 08:57:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 11 [2018-11-10 08:57:59,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:59,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:57:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:57:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:57:59,048 INFO L87 Difference]: Start difference. First operand 888 states and 1427 transitions. Second operand 4 states. [2018-11-10 08:57:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:59,141 INFO L93 Difference]: Finished difference Result 1039 states and 1656 transitions. [2018-11-10 08:57:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:57:59,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-10 08:57:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:59,144 INFO L225 Difference]: With dead ends: 1039 [2018-11-10 08:57:59,144 INFO L226 Difference]: Without dead ends: 680 [2018-11-10 08:57:59,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:57:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-11-10 08:57:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2018-11-10 08:57:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-10 08:57:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1076 transitions. [2018-11-10 08:57:59,215 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1076 transitions. Word has length 43 [2018-11-10 08:57:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:59,215 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 1076 transitions. [2018-11-10 08:57:59,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:57:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1076 transitions. [2018-11-10 08:57:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 08:57:59,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:59,216 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2018-11-10 08:57:59,216 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:59,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1269153316, now seen corresponding path program 1 times [2018-11-10 08:57:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:59,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 08:57:59,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:59,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:59,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 08:57:59,267 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [107], [108], [109], [110], [119], [120], [121], [122] [2018-11-10 08:57:59,267 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:59,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:59,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:59,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:59,281 INFO L272 AbstractInterpreter]: Visited 31 different actions 47 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 08:57:59,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:59,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:59,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:59,291 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:59,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:59,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:59,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 08:57:59,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 08:57:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:57:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-11-10 08:57:59,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:57:59,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:57:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:57:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:57:59,398 INFO L87 Difference]: Start difference. First operand 680 states and 1076 transitions. Second operand 7 states. [2018-11-10 08:57:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:57:59,565 INFO L93 Difference]: Finished difference Result 690 states and 1084 transitions. [2018-11-10 08:57:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:57:59,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-10 08:57:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:57:59,568 INFO L225 Difference]: With dead ends: 690 [2018-11-10 08:57:59,568 INFO L226 Difference]: Without dead ends: 688 [2018-11-10 08:57:59,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-10 08:57:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-10 08:57:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 682. [2018-11-10 08:57:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-10 08:57:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1075 transitions. [2018-11-10 08:57:59,675 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1075 transitions. Word has length 45 [2018-11-10 08:57:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:57:59,675 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 1075 transitions. [2018-11-10 08:57:59,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:57:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1075 transitions. [2018-11-10 08:57:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 08:57:59,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:57:59,676 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2018-11-10 08:57:59,676 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:57:59,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash -893792404, now seen corresponding path program 1 times [2018-11-10 08:57:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:57:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:59,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:57:59,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:57:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 08:57:59,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:59,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:57:59,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-10 08:57:59,761 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [119], [120], [121], [122] [2018-11-10 08:57:59,762 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:57:59,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:57:59,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:57:59,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:57:59,776 INFO L272 AbstractInterpreter]: Visited 29 different actions 41 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 08:57:59,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:57:59,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:57:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:57:59,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:57:59,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:57:59,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:57:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:57:59,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:57:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 08:57:59,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:57:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 08:57:59,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:57:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-11-10 08:57:59,921 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:57:59,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 08:57:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 08:57:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:57:59,923 INFO L87 Difference]: Start difference. First operand 682 states and 1075 transitions. Second operand 11 states. [2018-11-10 08:58:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:01,050 INFO L93 Difference]: Finished difference Result 1359 states and 2199 transitions. [2018-11-10 08:58:01,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 08:58:01,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-10 08:58:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:01,054 INFO L225 Difference]: With dead ends: 1359 [2018-11-10 08:58:01,054 INFO L226 Difference]: Without dead ends: 1035 [2018-11-10 08:58:01,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-11-10 08:58:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-11-10 08:58:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 806. [2018-11-10 08:58:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-10 08:58:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1291 transitions. [2018-11-10 08:58:01,164 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1291 transitions. Word has length 50 [2018-11-10 08:58:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:01,164 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1291 transitions. [2018-11-10 08:58:01,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 08:58:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1291 transitions. [2018-11-10 08:58:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 08:58:01,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:01,165 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-11-10 08:58:01,165 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -254314127, now seen corresponding path program 1 times [2018-11-10 08:58:01,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:01,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 08:58:01,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:01,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:01,239 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 08:58:01,239 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [107], [108], [109], [110], [119], [120], [121], [122] [2018-11-10 08:58:01,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:01,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:01,242 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:01,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:01,255 INFO L272 AbstractInterpreter]: Visited 37 different actions 65 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 08:58:01,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:01,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:01,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:01,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:01,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:01,262 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 08:58:01,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 08:58:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:01,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-11-10 08:58:01,468 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:01,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 08:58:01,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:58:01,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-10 08:58:01,469 INFO L87 Difference]: Start difference. First operand 806 states and 1291 transitions. Second operand 14 states. [2018-11-10 08:58:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:02,157 INFO L93 Difference]: Finished difference Result 1054 states and 1688 transitions. [2018-11-10 08:58:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:58:02,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-11-10 08:58:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:02,162 INFO L225 Difference]: With dead ends: 1054 [2018-11-10 08:58:02,162 INFO L226 Difference]: Without dead ends: 1052 [2018-11-10 08:58:02,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-11-10 08:58:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-11-10 08:58:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 824. [2018-11-10 08:58:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-11-10 08:58:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1317 transitions. [2018-11-10 08:58:02,261 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1317 transitions. Word has length 60 [2018-11-10 08:58:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:02,261 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1317 transitions. [2018-11-10 08:58:02,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 08:58:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1317 transitions. [2018-11-10 08:58:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 08:58:02,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:02,262 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-11-10 08:58:02,263 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:02,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1004327087, now seen corresponding path program 1 times [2018-11-10 08:58:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:02,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:02,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 08:58:02,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:02,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:02,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 08:58:02,304 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [74], [77], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [107], [108], [109], [110], [123], [124], [125], [126] [2018-11-10 08:58:02,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:02,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:02,306 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:02,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:02,406 INFO L272 AbstractInterpreter]: Visited 36 different actions 406 times. Merged at 17 different actions 102 times. Widened at 2 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 08:58:02,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:02,431 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:02,472 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 76.37% of their original sizes. [2018-11-10 08:58:02,472 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:02,601 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 08:58:02,601 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:02,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:02,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-11-10 08:58:02,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:02,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 08:58:02,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 08:58:02,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:58:02,602 INFO L87 Difference]: Start difference. First operand 824 states and 1317 transitions. Second operand 16 states. [2018-11-10 08:58:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:06,183 INFO L93 Difference]: Finished difference Result 1475 states and 2366 transitions. [2018-11-10 08:58:06,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 08:58:06,183 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-11-10 08:58:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:06,186 INFO L225 Difference]: With dead ends: 1475 [2018-11-10 08:58:06,186 INFO L226 Difference]: Without dead ends: 1052 [2018-11-10 08:58:06,187 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 08:58:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-11-10 08:58:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 966. [2018-11-10 08:58:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-10 08:58:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1544 transitions. [2018-11-10 08:58:06,355 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1544 transitions. Word has length 60 [2018-11-10 08:58:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:06,355 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1544 transitions. [2018-11-10 08:58:06,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 08:58:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1544 transitions. [2018-11-10 08:58:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 08:58:06,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:06,357 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-11-10 08:58:06,357 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:06,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -283854137, now seen corresponding path program 1 times [2018-11-10 08:58:06,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:06,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 08:58:06,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,400 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:06,400 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-10 08:58:06,401 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-11-10 08:58:06,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:06,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:06,404 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:06,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:06,428 INFO L272 AbstractInterpreter]: Visited 32 different actions 95 times. Merged at 12 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-11-10 08:58:06,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:06,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:06,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:06,440 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:06,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:06,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:06,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 08:58:06,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 08:58:06,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:58:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-11-10 08:58:06,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:06,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:58:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:58:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:58:06,641 INFO L87 Difference]: Start difference. First operand 966 states and 1544 transitions. Second operand 6 states. [2018-11-10 08:58:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:07,085 INFO L93 Difference]: Finished difference Result 1860 states and 2967 transitions. [2018-11-10 08:58:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:58:07,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 08:58:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:07,088 INFO L225 Difference]: With dead ends: 1860 [2018-11-10 08:58:07,088 INFO L226 Difference]: Without dead ends: 971 [2018-11-10 08:58:07,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:58:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-11-10 08:58:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 914. [2018-11-10 08:58:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-11-10 08:58:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1448 transitions. [2018-11-10 08:58:07,253 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1448 transitions. Word has length 69 [2018-11-10 08:58:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:07,254 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1448 transitions. [2018-11-10 08:58:07,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:58:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1448 transitions. [2018-11-10 08:58:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 08:58:07,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:07,255 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-11-10 08:58:07,255 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:07,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1790518670, now seen corresponding path program 1 times [2018-11-10 08:58:07,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:07,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:07,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:07,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 08:58:07,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:07,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:07,349 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 08:58:07,349 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [119], [120], [121], [122] [2018-11-10 08:58:07,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:07,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:07,352 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:07,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:07,373 INFO L272 AbstractInterpreter]: Visited 40 different actions 97 times. Merged at 8 different actions 8 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-10 08:58:07,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:07,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:07,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:07,384 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:07,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:07,393 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:07,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 08:58:07,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 08:58:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2018-11-10 08:58:07,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:07,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 08:58:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 08:58:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2018-11-10 08:58:07,729 INFO L87 Difference]: Start difference. First operand 914 states and 1448 transitions. Second operand 16 states. [2018-11-10 08:58:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:09,018 INFO L93 Difference]: Finished difference Result 1323 states and 2089 transitions. [2018-11-10 08:58:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 08:58:09,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-11-10 08:58:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:09,023 INFO L225 Difference]: With dead ends: 1323 [2018-11-10 08:58:09,023 INFO L226 Difference]: Without dead ends: 1321 [2018-11-10 08:58:09,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=931, Unknown=1, NotChecked=0, Total=1190 [2018-11-10 08:58:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-11-10 08:58:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1054. [2018-11-10 08:58:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-10 08:58:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1685 transitions. [2018-11-10 08:58:09,215 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1685 transitions. Word has length 72 [2018-11-10 08:58:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:09,215 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1685 transitions. [2018-11-10 08:58:09,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 08:58:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1685 transitions. [2018-11-10 08:58:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 08:58:09,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:09,216 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-11-10 08:58:09,217 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:09,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash -71103634, now seen corresponding path program 1 times [2018-11-10 08:58:09,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:09,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:09,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:09,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 08:58:09,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:09,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:09,282 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 08:58:09,282 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [74], [77], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [123], [124], [125], [126] [2018-11-10 08:58:09,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:09,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:09,286 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:09,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:58:09,410 INFO L272 AbstractInterpreter]: Visited 39 different actions 481 times. Merged at 20 different actions 129 times. Widened at 2 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 16 variables. [2018-11-10 08:58:09,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:09,412 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:58:09,460 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 77.38% of their original sizes. [2018-11-10 08:58:09,460 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:58:09,692 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-11-10 08:58:09,692 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:58:09,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:09,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2018-11-10 08:58:09,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:09,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 08:58:09,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 08:58:09,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:58:09,693 INFO L87 Difference]: Start difference. First operand 1054 states and 1685 transitions. Second operand 18 states. [2018-11-10 08:58:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:14,418 INFO L93 Difference]: Finished difference Result 1759 states and 2796 transitions. [2018-11-10 08:58:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 08:58:14,418 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-11-10 08:58:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:14,421 INFO L225 Difference]: With dead ends: 1759 [2018-11-10 08:58:14,422 INFO L226 Difference]: Without dead ends: 1270 [2018-11-10 08:58:14,423 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 08:58:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-11-10 08:58:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1066. [2018-11-10 08:58:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-11-10 08:58:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1694 transitions. [2018-11-10 08:58:14,578 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1694 transitions. Word has length 72 [2018-11-10 08:58:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:14,578 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1694 transitions. [2018-11-10 08:58:14,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 08:58:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1694 transitions. [2018-11-10 08:58:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 08:58:14,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:14,580 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 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] [2018-11-10 08:58:14,580 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:14,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash -217479284, now seen corresponding path program 1 times [2018-11-10 08:58:14,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:14,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-10 08:58:14,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:14,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:14,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-10 08:58:14,624 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [58], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [119], [120], [121], [122] [2018-11-10 08:58:14,625 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:14,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:14,630 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:14,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:14,645 INFO L272 AbstractInterpreter]: Visited 42 different actions 109 times. Merged at 9 different actions 9 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-10 08:58:14,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:14,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:14,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:14,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:14,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:14,652 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:14,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-10 08:58:14,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-10 08:58:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:58:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-11-10 08:58:14,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:58:14,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:58:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:58:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:58:14,734 INFO L87 Difference]: Start difference. First operand 1066 states and 1694 transitions. Second operand 7 states. [2018-11-10 08:58:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:15,020 INFO L93 Difference]: Finished difference Result 1166 states and 1830 transitions. [2018-11-10 08:58:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:58:15,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-10 08:58:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:15,023 INFO L225 Difference]: With dead ends: 1166 [2018-11-10 08:58:15,024 INFO L226 Difference]: Without dead ends: 1164 [2018-11-10 08:58:15,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:58:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-11-10 08:58:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1086. [2018-11-10 08:58:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-10 08:58:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1709 transitions. [2018-11-10 08:58:15,197 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1709 transitions. Word has length 79 [2018-11-10 08:58:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:15,197 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1709 transitions. [2018-11-10 08:58:15,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:58:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1709 transitions. [2018-11-10 08:58:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 08:58:15,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:15,198 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 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] [2018-11-10 08:58:15,198 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:15,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133516, now seen corresponding path program 1 times [2018-11-10 08:58:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:15,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:15,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-10 08:58:15,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:15,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:15,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-11-10 08:58:15,245 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-11-10 08:58:15,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:58:15,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:58:15,248 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:58:15,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:58:15,293 INFO L272 AbstractInterpreter]: Visited 43 different actions 339 times. Merged at 19 different actions 63 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 08:58:15,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:15,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:58:15,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:15,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:15,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:15,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:58:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:15,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 08:58:15,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 08:58:15,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:15,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2018-11-10 08:58:15,411 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:15,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 08:58:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:58:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 08:58:15,411 INFO L87 Difference]: Start difference. First operand 1086 states and 1709 transitions. Second operand 13 states. [2018-11-10 08:58:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:16,328 INFO L93 Difference]: Finished difference Result 1851 states and 3014 transitions. [2018-11-10 08:58:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 08:58:16,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-11-10 08:58:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:16,333 INFO L225 Difference]: With dead ends: 1851 [2018-11-10 08:58:16,333 INFO L226 Difference]: Without dead ends: 1849 [2018-11-10 08:58:16,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-11-10 08:58:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-11-10 08:58:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1098. [2018-11-10 08:58:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-11-10 08:58:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1718 transitions. [2018-11-10 08:58:16,548 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1718 transitions. Word has length 86 [2018-11-10 08:58:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:16,549 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1718 transitions. [2018-11-10 08:58:16,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 08:58:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1718 transitions. [2018-11-10 08:58:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 08:58:16,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:58:16,550 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 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] [2018-11-10 08:58:16,551 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:58:16,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:58:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 2 times [2018-11-10 08:58:16,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:58:16,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:16,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:58:16,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:58:16,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:58:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:58:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-10 08:58:16,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:16,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:58:16,607 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 08:58:16,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 08:58:16,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:58:16,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:58:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:58:16,612 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 08:58:16,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 08:58:16,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:58:16,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:58:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-10 08:58:16,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:58:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-10 08:58:16,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:58:16,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-11-10 08:58:16,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:58:16,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 08:58:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 08:58:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:58:16,771 INFO L87 Difference]: Start difference. First operand 1098 states and 1718 transitions. Second operand 14 states. [2018-11-10 08:58:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:58:17,259 INFO L93 Difference]: Finished difference Result 1238 states and 1922 transitions. [2018-11-10 08:58:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 08:58:17,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-11-10 08:58:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:58:17,260 INFO L225 Difference]: With dead ends: 1238 [2018-11-10 08:58:17,260 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:58:17,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:58:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:58:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:58:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:58:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:58:17,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-11-10 08:58:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:58:17,265 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:58:17,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 08:58:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:58:17,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:58:17,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:58:17,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:17,771 WARN L179 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-11-10 08:58:18,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,649 WARN L179 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 457 DAG size of output: 426 [2018-11-10 08:58:18,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,981 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-11-10 08:58:18,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:18,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,680 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 462 DAG size of output: 438 [2018-11-10 08:58:19,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:19,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,329 WARN L179 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 373 [2018-11-10 08:58:20,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,723 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 286 [2018-11-10 08:58:20,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:20,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,464 WARN L179 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 484 DAG size of output: 431 [2018-11-10 08:58:21,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:21,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,187 WARN L179 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 632 DAG size of output: 455 [2018-11-10 08:58:22,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:22,988 WARN L179 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 521 DAG size of output: 479 [2018-11-10 08:58:23,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:23,999 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 728 DAG size of output: 545 [2018-11-10 08:58:24,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:58:24,281 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 266 [2018-11-10 08:58:25,791 WARN L179 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-11-10 08:58:30,619 WARN L179 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 424 DAG size of output: 75 [2018-11-10 08:58:32,024 WARN L179 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-11-10 08:58:35,491 WARN L179 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 435 DAG size of output: 91 [2018-11-10 08:58:36,768 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-11-10 08:58:38,030 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 220 DAG size of output: 61 [2018-11-10 08:58:39,982 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 350 DAG size of output: 68 [2018-11-10 08:58:41,254 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-11-10 08:58:42,675 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 268 DAG size of output: 69 [2018-11-10 08:58:45,310 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 421 DAG size of output: 70 [2018-11-10 08:58:46,601 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 219 DAG size of output: 61 [2018-11-10 08:58:49,684 WARN L179 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 423 DAG size of output: 71 [2018-11-10 08:58:53,177 WARN L179 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 470 DAG size of output: 83 [2018-11-10 08:58:56,709 WARN L179 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 508 DAG size of output: 59 [2018-11-10 08:58:58,389 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 254 DAG size of output: 81 [2018-11-10 08:58:58,392 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 08:58:58,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:58:58,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:58:58,392 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 08:58:58,392 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:58:58,392 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:58:58,392 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-11-10 08:58:58,392 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-11-10 08:58:58,392 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse10 (* 2 main_~l~0))) (let ((.cse2 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse4 (< 0 main_~l~0)) (.cse6 (<= 1 main_~l~0)) (.cse9 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse7 (<= (* 2 main_~n~0) 4294967294)) (.cse3 (<= main_~j~0 main_~n~0)) (.cse8 (<= .cse10 main_~r~0)) (.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and (and .cse0 (and .cse1 (<= main_~n~0 main_~r~0) .cse2 (and .cse3 (<= main_~l~0 (div main_~n~0 2)) .cse4))) .cse5) (and (and .cse0 (and (and .cse6 .cse7 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse1)) .cse5) (and (and .cse3 .cse8 .cse0 .cse9 (<= (+ main_~r~0 1) main_~n~0) .cse2 .cse4) .cse5) (and (and .cse6 .cse9 .cse7 .cse3 .cse8 .cse0 .cse1 (<= (+ .cse10 2) main_~n~0)) .cse5)))) [2018-11-10 08:58:58,392 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-11-10 08:58:58,392 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0)) (.cse10 (* 2 main_~n~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse2 (<= .cse10 4294967294)) (.cse13 (<= 2 main_~r~0)) (.cse8 (<= .cse6 main_~j~0)) (.cse16 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse3 (<= .cse6 main_~r~0)) (.cse9 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse7 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse22 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse11 (<= (+ main_~r~0 1) main_~n~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse15 (<= (* 2 main_~j~0) 4294967296)) (.cse4 (<= 1 main_~i~0)) (.cse17 (<= .cse6 main_~n~0)) (.cse18 (= (mod main_~j~0 2) 0)) (.cse19 (<= main_~n~0 main_~r~0)) (.cse21 (exists ((v_main_~j~0_39 Int) (main_~l~0 Int)) (and (<= main_~r~0 v_main_~j~0_39) (<= (* 2 v_main_~j~0_39) main_~j~0) (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_39)))) (.cse20 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse12 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ .cse6 2) main_~n~0) .cse7) (and .cse8 .cse9 (<= main_~i~0 (div main_~n~0 2)) (<= .cse10 2000000) .cse7 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse9 .cse8 (exists ((main_~l~0 Int)) (let ((.cse14 (* 2 main_~l~0))) (and (<= (+ .cse14 2) main_~n~0) (<= main_~j~0 .cse14)))) .cse5 .cse13 .cse7) (and .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse7 .cse1 .cse20 .cse12) (and .cse8 .cse9 .cse5 .cse7 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse20 .cse12) (and (and .cse18 .cse15 .cse3 .cse4 .cse21 .cse11 .cse20 .cse12) .cse1 .cse7) (and .cse15 .cse3 .cse16 .cse18 .cse7 .cse1 .cse11 .cse20 .cse12) (and .cse9 .cse17 .cse5 .cse19 .cse7 .cse1 .cse22 .cse20 .cse12) (and .cse3 .cse9 .cse7 .cse1 .cse22 .cse11 .cse20 .cse12) (and .cse1 .cse5 (and .cse15 .cse4 .cse17 .cse18 .cse19 .cse21 .cse20 .cse12))))) [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-11-10 08:58:58,393 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-11-10 08:58:58,394 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse16 (* 2 main_~l~0))) (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse6 (<= 1 main_~i~0)) (.cse11 (<= .cse16 2)) (.cse7 (= (mod main_~j~0 2) 0)) (.cse8 (<= (* 2 main_~j~0) 4294967296)) (.cse10 (<= main_~j~0 main_~n~0)) (.cse12 (< 0 main_~l~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse2 (<= 2 main_~j~0)) (.cse3 (<= 1 main_~l~0)) (.cse13 (<= 2 main_~r~0)) (.cse14 (<= (+ main_~r~0 1) main_~n~0)) (.cse4 (<= (* 2 main_~n~0) 4294967294)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 .cse1 (and (and (and .cse2 .cse3) (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4) .cse5) (and (and .cse6 (let ((.cse9 (and .cse11 (and .cse2 .cse12 .cse13 .cse14) (<= main_~n~0 (+ main_~l~0 999999))))) (or (and .cse7 .cse8 .cse9) (and .cse10 .cse9)))) .cse5) (and .cse0 (and .cse6 (and (and .cse11 (and (and (let ((.cse15 (and (and .cse2 (<= main_~n~0 main_~r~0)) .cse12))) (or (and .cse15 .cse7 .cse8) (and .cse15 .cse10))) .cse1) (<= .cse16 main_~n~0))) (<= (+ main_~n~0 main_~r~0) 2000000))) .cse5) (and (and (and (let ((.cse17 (and .cse13 .cse14))) (or (and .cse2 (<= .cse16 main_~r~0) .cse3 .cse17) (and .cse3 .cse17 (<= .cse16 main_~j~0)))) (<= (+ .cse16 2) main_~n~0)) .cse4) .cse5)))) [2018-11-10 08:58:58,394 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse1 (<= main_~r~0 main_~n~0)) (.cse7 (<= 1 main_~i~0)) (.cse12 (<= main_~j~0 main_~n~0)) (.cse10 (= (mod main_~j~0 2) 0)) (.cse11 (<= (* 2 main_~j~0) 4294967296)) (.cse8 (<= .cse3 2)) (.cse4 (<= 2 main_~j~0)) (.cse5 (<= .cse3 main_~r~0)) (.cse13 (< 0 main_~l~0)) (.cse6 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and (and (let ((.cse0 (<= 1 main_~l~0)) (.cse2 (<= (* 2 main_~n~0) 4294967294))) (or (and .cse0 .cse1 .cse2 (<= .cse3 main_~j~0)) (and .cse4 .cse5 .cse0 .cse1 .cse2))) (<= (+ .cse3 2) main_~n~0)) (< 1 main_~r~0) .cse6) (and (<= main_~i~0 main_~n~0) (and .cse7 (and (and .cse8 (and (and (let ((.cse9 (and (and .cse4 (<= main_~n~0 main_~r~0)) .cse13))) (or (and .cse9 .cse10 .cse11) (and .cse9 .cse12))) .cse1) (<= .cse3 main_~n~0))) (<= (+ main_~n~0 main_~r~0) 2000000))) .cse6) (and (and .cse7 (let ((.cse14 (and .cse8 (and .cse4 .cse5 .cse13 (<= (+ main_~r~0 1) main_~n~0)) (<= main_~n~0 (+ main_~l~0 999999))))) (or (and .cse12 .cse14) (and .cse10 .cse11 .cse14)))) .cse6)))) [2018-11-10 08:58:58,394 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse20 (* 2 main_~n~0))) (let ((.cse22 (<= .cse20 4294967294))) (let ((.cse3 (and (<= 1 main_~l~0) .cse22 (<= 2 main_~r~0))) (.cse8 (* 2 main_~l~0)) (.cse19 (div main_~n~0 2)) (.cse21 (<= (+ main_~r~0 1) main_~n~0))) (let ((.cse2 (<= 2 main_~j~0)) (.cse7 (and (<= main_~l~0 (+ .cse19 1)) .cse22 (< 1 main_~r~0) .cse21)) (.cse6 (<= .cse8 main_~r~0)) (.cse13 (and .cse3 .cse21)) (.cse10 (<= .cse8 main_~j~0)) (.cse9 (<= 1 main_~i~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse4 (<= 2 main_~l~0)) (.cse14 (<= main_~j~0 main_~n~0)) (.cse15 (= (mod main_~j~0 2) 0)) (.cse16 (<= (* 2 main_~j~0) 4294967296)) (.cse12 (<= .cse20 2000000)) (.cse0 (<= main_~i~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 .cse1 (and (and .cse2 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4) .cse5) (and (and (and (and .cse2 .cse6 .cse7) (<= (+ .cse8 2) main_~n~0)) .cse4) .cse5) (and .cse9 (and .cse7 .cse4) .cse10 (exists ((main_~l~0 Int)) (let ((.cse11 (* 2 main_~l~0))) (and (<= (+ .cse11 2) main_~n~0) (<= main_~j~0 .cse11)))) .cse5) (and (and .cse9 (and (and (and .cse12 (and .cse6 .cse13)) .cse14) .cse4)) .cse5) (and .cse9 .cse4 (and (and .cse13 .cse10) (<= .cse8 main_~n~0) .cse12 .cse15 .cse16) .cse5) (and (and .cse9 (and .cse1 (and .cse4 (let ((.cse17 (and (and (<= main_~r~0 (+ main_~l~0 999999)) .cse12) (< 0 main_~l~0) (<= main_~l~0 .cse19))) (.cse18 (<= main_~n~0 main_~r~0))) (or (and .cse14 .cse17 .cse18) (and .cse15 .cse16 .cse17 .cse18)))))) .cse0 .cse5)))))) [2018-11-10 08:58:58,394 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-10 08:58:58,394 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse11 (* 2 main_~n~0))) (let ((.cse12 (div main_~n~0 2)) (.cse8 (and (<= 1 main_~l~0) (<= .cse11 4294967294)))) (let ((.cse7 (<= 2 main_~j~0)) (.cse1 (* 2 main_~l~0)) (.cse2 (and (and (<= main_~l~0 (+ .cse12 1)) .cse8) (< 1 main_~r~0) (<= (+ main_~r~0 1) main_~n~0))) (.cse0 (<= 1 main_~i~0)) (.cse6 (<= main_~r~0 main_~n~0)) (.cse3 (<= 2 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse4 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 (and (<= .cse1 main_~j~0) (and .cse2 (<= .cse1 main_~n~0))) .cse3 .cse4) (and .cse5 .cse6 (and (and .cse7 .cse8 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse3) .cse4) (and (and .cse7 (<= .cse1 main_~r~0) .cse3 .cse2) .cse4) (and (and .cse0 (and .cse6 (and .cse3 (let ((.cse9 (and (and (<= main_~r~0 (+ main_~l~0 999999)) (<= .cse11 2000000)) (< 0 main_~l~0) (<= main_~l~0 .cse12))) (.cse10 (<= main_~n~0 main_~r~0))) (or (and (<= main_~j~0 main_~n~0) .cse9 .cse10) (and (= (mod main_~j~0 2) 0) (<= (* 2 main_~j~0) 4294967296) .cse9 .cse10)))))) .cse5 .cse4))))) [2018-11-10 08:58:58,394 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-11-10 08:58:58,395 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-11-10 08:58:58,395 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse12 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse9 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse12 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse8 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse10 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse11 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse9 .cse6 .cse3 (<= (+ .cse12 2) main_~n~0)) .cse5) (and (and .cse3 (and .cse2 (<= main_~l~0 (div main_~n~0 2))) .cse4 (<= main_~n~0 main_~r~0) .cse8 (<= 2 .cse12) .cse10) .cse5) (and (<= .cse12 main_~j~0) (<= 2 (* 2 main_~i~0)) .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse10 .cse11)))) [2018-11-10 08:58:58,395 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 08:58:58,395 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-10 08:58:58,395 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-11-10 08:58:58,395 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-11-10 08:58:58,395 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-11-10 08:58:58,395 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-10 08:58:58,395 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-10 08:58:58,395 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse1 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse2 (<= (* 2 main_~n~0) 4294967294)) (.cse6 (<= .cse11 main_~r~0)) (.cse0 (<= 1 main_~i~0)) (.cse3 (<= main_~j~0 main_~n~0)) (.cse8 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and (and .cse0 (and (and .cse1 .cse2 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4)) .cse5) (and .cse3 (and .cse6 .cse0 .cse7 .cse8 (<= (+ main_~r~0 1) main_~n~0) .cse9 .cse10) .cse5) (and (and .cse1 .cse7 .cse2 .cse3 .cse6 .cse0 .cse4 (<= (+ .cse11 2) main_~n~0)) .cse5) (and (and .cse0 (and .cse3 (<= main_~l~0 (div main_~n~0 2))) .cse4 (<= main_~n~0 main_~r~0) .cse8 (<= 2 .cse11) .cse9) .cse5) (and (<= .cse11 main_~j~0) (<= 2 (* 2 main_~i~0)) .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-11-10 08:58:58,395 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-10 08:58:58,396 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 08:58:58,396 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 08:58:58,396 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 08:58:58,396 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 08:58:58,396 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 08:58:58,396 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 08:58:58,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:58:58 BoogieIcfgContainer [2018-11-10 08:58:58,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:58:58,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:58:58,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:58:58,429 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:58:58,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:57:46" (3/4) ... [2018-11-10 08:58:58,433 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:58:58,437 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:58:58,437 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:58:58,437 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 08:58:58,440 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-10 08:58:58,440 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 08:58:58,441 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 08:58:58,441 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 08:58:58,457 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 <= l && i <= n) && 2 * n <= 4294967294) && 2 * l <= r) && 1 <= i) && r <= n) && 2 * l + 2 <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) || (((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && i <= n / 2) && 2 * n <= 2000000) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && r + 1 <= n) && 0 < l) && 2 <= r)) || (((((((1 <= l && 2 * n <= 4294967294) && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && 2 * l <= j) && (\exists main_~l~0 : int :: 2 * main_~l~0 + 2 <= n && j <= 2 * main_~l~0)) && r <= n) && 2 <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || (((((((((2 * j <= 4294967296 && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && 2 * l <= n) && j % 2 == 0) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && n + r <= 2000000) && 0 < l)) || ((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && r <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && (\exists main_~l~0 : int, main_~n~0 : int :: (((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && j <= 2 * main_~l~0) && main_~l~0 <= main_~n~0 / 2)) && n + r <= 2000000) && 0 < l)) || (((((((((j % 2 == 0 && 2 * j <= 4294967296) && 2 * l <= r) && 1 <= i) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && r + 1 <= n) && n + r <= 2000000) && 0 < l) && i <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || ((((((((2 * j <= 4294967296 && 2 * l <= r) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && j % 2 == 0) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || (((((((((\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0) && 2 * l <= n) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && n + r <= 2000000) && 0 < l)) || (((((((2 * l <= r && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || ((i <= n && r <= n) && ((((((2 * j <= 4294967296 && 1 <= i) && 2 * l <= n) && j % 2 == 0) && n <= r) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && n + r <= 2000000) && 0 < l) [2018-11-10 08:58:58,473 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_af9f1929-5e50-45e6-8b41-3e7825551944/bin-2019/utaipan/witness.graphml [2018-11-10 08:58:58,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:58:58,474 INFO L168 Benchmark]: Toolchain (without parser) took 71885.94 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 851.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 703.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.73 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: Boogie Preprocessor took 14.59 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: RCFGBuilder took 210.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:58:58,475 INFO L168 Benchmark]: TraceAbstraction took 71448.26 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 719.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:58:58,476 INFO L168 Benchmark]: Witness Printer took 44.93 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:58:58,477 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.73 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.59 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71448.26 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 719.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 44.93 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 24]: Loop Invariant [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-11-10 08:58:58,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-10 08:58:58,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] Derived loop invariant: (((((((((((((((1 <= l && i <= n) && 2 * n <= 4294967294) && 2 * l <= r) && 1 <= i) && r <= n) && 2 * l + 2 <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) || (((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && i <= n / 2) && 2 * n <= 2000000) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && r + 1 <= n) && 0 < l) && 2 <= r)) || (((((((1 <= l && 2 * n <= 4294967294) && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && 2 * l <= j) && (\exists main_~l~0 : int :: 2 * main_~l~0 + 2 <= n && j <= 2 * main_~l~0)) && r <= n) && 2 <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || (((((((((2 * j <= 4294967296 && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && 2 * l <= n) && j % 2 == 0) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && n + r <= 2000000) && 0 < l)) || ((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && r <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && (\exists main_~l~0 : int, main_~n~0 : int :: (((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && j <= 2 * main_~l~0) && main_~l~0 <= main_~n~0 / 2)) && n + r <= 2000000) && 0 < l)) || (((((((((j % 2 == 0 && 2 * j <= 4294967296) && 2 * l <= r) && 1 <= i) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && r + 1 <= n) && n + r <= 2000000) && 0 < l) && i <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || ((((((((2 * j <= 4294967296 && 2 * l <= r) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && j % 2 == 0) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || (((((((((\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0) && 2 * l <= n) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && n + r <= 2000000) && 0 < l)) || (((((((2 * l <= r && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || ((i <= n && r <= n) && ((((((2 * j <= 4294967296 && 1 <= i) && 2 * l <= n) && j % 2 == 0) && n <= r) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && n + r <= 2000000) && 0 < l) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 71.3s OverallTime, 23 OverallIterations, 14 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 41.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1720 SDtfs, 2109 SDslu, 6453 SDs, 0 SdLazy, 7636 SolverSat, 4246 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2040 GetRequests, 1578 SyntacticMatches, 22 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 19 AbstIntIterations, 7 AbstIntStrong, 0.8741993136974552 AbsIntWeakeningRatio, 0.6988847583643123 AbsIntAvgWeakeningVarsNumRemoved, 14.680297397769516 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 1910 PreInvPairs, 2495 NumberOfFragments, 4392 HoareAnnotationTreeSize, 1910 FomulaSimplifications, 70464259599 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 19098922446 FormulaSimplificationTreeSizeReductionInter, 34.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1682 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2404 ConstructedInterpolants, 156 QuantifiedInterpolants, 401926 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1472 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 49 InterpolantComputations, 16 PerfectInterpolantSequences, 4409/4807 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...