./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_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:39:58,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:39:58,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:39:58,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:39:58,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:39:58,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:39:58,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:39:58,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:39:58,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:39:58,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:39:58,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:39:58,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:39:58,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:39:58,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:39:58,274 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:39:58,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:39:58,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:39:58,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:39:58,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:39:58,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:39:58,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:39:58,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:39:58,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:39:58,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:39:58,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:39:58,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:39:58,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:39:58,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:39:58,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:39:58,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:39:58,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:39:58,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:39:58,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:39:58,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:39:58,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:39:58,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:39:58,304 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:39:58,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:39:58,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:39:58,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:39:58,320 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:39:58,320 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:39:58,320 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:39:58,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:39:58,321 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:39:58,321 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:39:58,321 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:39:58,321 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:39:58,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:39:58,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:39:58,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:39:58,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:39:58,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:39:58,323 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:39:58,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:39:58,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:39:58,325 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:39:58,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:39:58,325 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:39:58,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:39:58,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:39:58,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:39:58,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:39:58,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:39:58,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:39:58,327 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:39:58,328 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_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:39:58,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:39:58,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:39:58,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:39:58,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:39:58,380 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:39:58,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-26 23:39:58,442 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/data/d37312911/cb2b0ff195084511b955a62c7707dedf/FLAG695df3892 [2018-10-26 23:39:58,873 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:39:58,874 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-26 23:39:58,879 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/data/d37312911/cb2b0ff195084511b955a62c7707dedf/FLAG695df3892 [2018-10-26 23:39:58,894 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/data/d37312911/cb2b0ff195084511b955a62c7707dedf [2018-10-26 23:39:58,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:39:58,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:39:58,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:39:58,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:39:58,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:39:58,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:39:58" (1/1) ... [2018-10-26 23:39:58,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68adbd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:58, skipping insertion in model container [2018-10-26 23:39:58,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:39:58" (1/1) ... [2018-10-26 23:39:58,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:39:58,943 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:39:59,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:39:59,113 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:39:59,136 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:39:59,151 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:39:59,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59 WrapperNode [2018-10-26 23:39:59,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:39:59,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:39:59,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:39:59,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:39:59,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:39:59,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:39:59,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:39:59,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:39:59,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... [2018-10-26 23:39:59,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:39:59,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:39:59,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:39:59,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:39:59,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:39:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:39:59,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:39:59,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:39:59,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:39:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 23:39:59,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 23:39:59,806 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:39:59,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:59 BoogieIcfgContainer [2018-10-26 23:39:59,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:39:59,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:39:59,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:39:59,812 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:39:59,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:39:58" (1/3) ... [2018-10-26 23:39:59,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db07c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:39:59, skipping insertion in model container [2018-10-26 23:39:59,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:59" (2/3) ... [2018-10-26 23:39:59,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db07c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:39:59, skipping insertion in model container [2018-10-26 23:39:59,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:59" (3/3) ... [2018-10-26 23:39:59,817 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-10-26 23:39:59,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:39:59,837 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:39:59,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:39:59,882 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:39:59,882 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:39:59,882 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:39:59,882 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:39:59,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:39:59,883 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:39:59,883 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:39:59,883 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:39:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-26 23:39:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 23:39:59,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:39:59,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:39:59,910 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:39:59,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:39:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-10-26 23:39:59,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:39:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:39:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:39:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:39:59,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:00,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:40:00,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 23:40:00,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:00,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 23:40:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 23:40:00,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:40:00,071 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-26 23:40:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:00,099 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-26 23:40:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 23:40:00,100 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-26 23:40:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:00,110 INFO L225 Difference]: With dead ends: 83 [2018-10-26 23:40:00,110 INFO L226 Difference]: Without dead ends: 40 [2018-10-26 23:40:00,114 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-10-26 23:40:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-26 23:40:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-26 23:40:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-26 23:40:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-10-26 23:40:00,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-10-26 23:40:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:00,166 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-10-26 23:40:00,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 23:40:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-10-26 23:40:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 23:40:00,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:00,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:40:00,168 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:00,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-10-26 23:40:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:00,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:00,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:40:00,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:40:00,509 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:00,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:40:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:40:00,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:40:00,512 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-10-26 23:40:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:01,109 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-10-26 23:40:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:40:01,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-26 23:40:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:01,112 INFO L225 Difference]: With dead ends: 77 [2018-10-26 23:40:01,112 INFO L226 Difference]: Without dead ends: 75 [2018-10-26 23:40:01,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:40:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-26 23:40:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-10-26 23:40:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 23:40:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-10-26 23:40:01,141 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-10-26 23:40:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:01,141 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-10-26 23:40:01,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:40:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-10-26 23:40:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 23:40:01,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:01,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:40:01,143 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:01,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-10-26 23:40:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:01,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:01,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:40:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:40:01,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:01,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:40:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:40:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:40:01,386 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-10-26 23:40:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:01,910 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-10-26 23:40:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:40:01,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-26 23:40:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:01,918 INFO L225 Difference]: With dead ends: 121 [2018-10-26 23:40:01,918 INFO L226 Difference]: Without dead ends: 119 [2018-10-26 23:40:01,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:40:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-26 23:40:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-10-26 23:40:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-26 23:40:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-10-26 23:40:01,942 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-10-26 23:40:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:01,942 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-10-26 23:40:01,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:40:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-10-26 23:40:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 23:40:01,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:01,944 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-10-26 23:40:01,944 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:01,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-10-26 23:40:01,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:01,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:01,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:01,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:01,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:02,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:02,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:02,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-26 23:40:02,050 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-10-26 23:40:02,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:02,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:02,233 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:02,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:02,290 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-26 23:40:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:02,303 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:02,422 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-26 23:40:02,422 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:02,730 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-26 23:40:02,730 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:02,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-26 23:40:02,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:02,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:40:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:40:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:40:02,732 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 10 states. [2018-10-26 23:40:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:06,742 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2018-10-26 23:40:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 23:40:06,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-26 23:40:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:06,744 INFO L225 Difference]: With dead ends: 294 [2018-10-26 23:40:06,745 INFO L226 Difference]: Without dead ends: 292 [2018-10-26 23:40:06,746 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-26 23:40:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-26 23:40:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249. [2018-10-26 23:40:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-26 23:40:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 398 transitions. [2018-10-26 23:40:06,819 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 398 transitions. Word has length 21 [2018-10-26 23:40:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:06,823 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 398 transitions. [2018-10-26 23:40:06,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:40:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 398 transitions. [2018-10-26 23:40:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 23:40:06,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:06,825 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-10-26 23:40:06,825 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:06,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1032051649, now seen corresponding path program 1 times [2018-10-26 23:40:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:06,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:06,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:06,955 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:06,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-26 23:40:06,956 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [69], [84], [87], [89], [92], [94], [95], [96], [97], [119], [120], [121] [2018-10-26 23:40:06,957 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:06,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:06,965 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:06,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:06,978 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-26 23:40:06,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:06,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:06,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:06,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:06,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:06,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:07,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 23:40:07,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:07,495 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:07,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-10-26 23:40:07,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:07,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:40:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:40:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:40:07,496 INFO L87 Difference]: Start difference. First operand 249 states and 398 transitions. Second operand 5 states. [2018-10-26 23:40:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:08,657 INFO L93 Difference]: Finished difference Result 552 states and 895 transitions. [2018-10-26 23:40:08,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:40:08,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-26 23:40:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:08,665 INFO L225 Difference]: With dead ends: 552 [2018-10-26 23:40:08,665 INFO L226 Difference]: Without dead ends: 388 [2018-10-26 23:40:08,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:40:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-26 23:40:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 297. [2018-10-26 23:40:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-26 23:40:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 477 transitions. [2018-10-26 23:40:08,746 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 477 transitions. Word has length 21 [2018-10-26 23:40:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:08,746 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 477 transitions. [2018-10-26 23:40:08,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:40:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 477 transitions. [2018-10-26 23:40:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 23:40:08,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:08,749 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-10-26 23:40:08,749 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:08,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1772370613, now seen corresponding path program 1 times [2018-10-26 23:40:08,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:08,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:08,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:08,955 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:08,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-26 23:40:08,955 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-10-26 23:40:08,957 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:08,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:08,965 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:08,977 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:08,977 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-26 23:40:08,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:08,987 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:09,025 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-26 23:40:09,025 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:09,459 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-26 23:40:09,460 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-10-26 23:40:09,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:09,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:40:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:40:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:40:09,461 INFO L87 Difference]: Start difference. First operand 297 states and 477 transitions. Second operand 9 states. [2018-10-26 23:40:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:12,050 INFO L93 Difference]: Finished difference Result 502 states and 796 transitions. [2018-10-26 23:40:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:40:12,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-10-26 23:40:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:12,054 INFO L225 Difference]: With dead ends: 502 [2018-10-26 23:40:12,054 INFO L226 Difference]: Without dead ends: 397 [2018-10-26 23:40:12,057 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:40:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-26 23:40:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2018-10-26 23:40:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-26 23:40:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 611 transitions. [2018-10-26 23:40:12,141 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 611 transitions. Word has length 21 [2018-10-26 23:40:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:12,141 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 611 transitions. [2018-10-26 23:40:12,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:40:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 611 transitions. [2018-10-26 23:40:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 23:40:12,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:12,142 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-10-26 23:40:12,143 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:12,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-10-26 23:40:12,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:12,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:12,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 23:40:12,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:12,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:12,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 23:40:12,641 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-10-26 23:40:12,642 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:12,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:12,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:12,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:12,661 INFO L272 AbstractInterpreter]: Visited 23 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:12,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:12,703 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:12,739 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 75.64% of their original sizes. [2018-10-26 23:40:12,739 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:12,884 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-10-26 23:40:12,885 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:12,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:12,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-26 23:40:12,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:12,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:40:12,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:40:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:40:12,886 INFO L87 Difference]: Start difference. First operand 385 states and 611 transitions. Second operand 12 states. [2018-10-26 23:40:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:18,384 INFO L93 Difference]: Finished difference Result 463 states and 731 transitions. [2018-10-26 23:40:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:40:18,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-26 23:40:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:18,387 INFO L225 Difference]: With dead ends: 463 [2018-10-26 23:40:18,387 INFO L226 Difference]: Without dead ends: 461 [2018-10-26 23:40:18,388 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-10-26 23:40:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-26 23:40:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 399. [2018-10-26 23:40:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 23:40:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 632 transitions. [2018-10-26 23:40:18,484 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 632 transitions. Word has length 28 [2018-10-26 23:40:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:18,485 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 632 transitions. [2018-10-26 23:40:18,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:40:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 632 transitions. [2018-10-26 23:40:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 23:40:18,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:18,486 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-10-26 23:40:18,486 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:18,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1497639215, now seen corresponding path program 1 times [2018-10-26 23:40:18,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:18,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 23:40:18,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:18,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:18,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 23:40:18,627 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-10-26 23:40:18,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:18,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:18,633 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:18,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:18,650 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:18,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:18,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:18,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:18,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:18,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:18,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:18,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-10-26 23:40:18,850 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:18,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:40:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:40:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:40:18,851 INFO L87 Difference]: Start difference. First operand 399 states and 632 transitions. Second operand 6 states. [2018-10-26 23:40:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:19,526 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2018-10-26 23:40:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:40:19,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-26 23:40:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:19,533 INFO L225 Difference]: With dead ends: 727 [2018-10-26 23:40:19,533 INFO L226 Difference]: Without dead ends: 725 [2018-10-26 23:40:19,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-26 23:40:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-10-26 23:40:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 628. [2018-10-26 23:40:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-26 23:40:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1028 transitions. [2018-10-26 23:40:19,685 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1028 transitions. Word has length 28 [2018-10-26 23:40:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:19,686 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 1028 transitions. [2018-10-26 23:40:19,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:40:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1028 transitions. [2018-10-26 23:40:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 23:40:19,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:19,688 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-10-26 23:40:19,688 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:19,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-10-26 23:40:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:19,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:19,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:19,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:19,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:40:19,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:19,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:19,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-26 23:40:19,794 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-10-26 23:40:19,795 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:19,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:19,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:19,815 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:19,815 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-26 23:40:19,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:19,835 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:19,865 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 77.67% of their original sizes. [2018-10-26 23:40:19,865 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:19,959 INFO L415 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2018-10-26 23:40:19,959 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:19,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:19,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-26 23:40:19,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:19,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:40:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:40:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:40:19,960 INFO L87 Difference]: Start difference. First operand 628 states and 1028 transitions. Second operand 10 states. [2018-10-26 23:40:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:22,515 INFO L93 Difference]: Finished difference Result 672 states and 1091 transitions. [2018-10-26 23:40:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 23:40:22,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-10-26 23:40:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:22,521 INFO L225 Difference]: With dead ends: 672 [2018-10-26 23:40:22,521 INFO L226 Difference]: Without dead ends: 670 [2018-10-26 23:40:22,522 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-26 23:40:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-26 23:40:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 632. [2018-10-26 23:40:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-26 23:40:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1031 transitions. [2018-10-26 23:40:22,653 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1031 transitions. Word has length 31 [2018-10-26 23:40:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:22,653 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 1031 transitions. [2018-10-26 23:40:22,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:40:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1031 transitions. [2018-10-26 23:40:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 23:40:22,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:22,655 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-10-26 23:40:22,657 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:22,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-10-26 23:40:22,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:22,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:22,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:22,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:22,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:40:22,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:22,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:22,750 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-26 23:40:22,750 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-10-26 23:40:22,751 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:22,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:22,756 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:22,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:22,771 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:22,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:22,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:22,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:22,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:22,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:22,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:40:22,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:40:23,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:40:23,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-10-26 23:40:23,048 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:40:23,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:40:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:40:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:40:23,049 INFO L87 Difference]: Start difference. First operand 632 states and 1031 transitions. Second operand 14 states. [2018-10-26 23:40:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:25,756 INFO L93 Difference]: Finished difference Result 981 states and 1602 transitions. [2018-10-26 23:40:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 23:40:25,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-26 23:40:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:25,762 INFO L225 Difference]: With dead ends: 981 [2018-10-26 23:40:25,762 INFO L226 Difference]: Without dead ends: 979 [2018-10-26 23:40:25,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-26 23:40:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-10-26 23:40:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 893. [2018-10-26 23:40:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-10-26 23:40:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1461 transitions. [2018-10-26 23:40:25,952 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1461 transitions. Word has length 33 [2018-10-26 23:40:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:25,952 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1461 transitions. [2018-10-26 23:40:25,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:40:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1461 transitions. [2018-10-26 23:40:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 23:40:25,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:25,953 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-10-26 23:40:25,953 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:25,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-10-26 23:40:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:25,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:40:26,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:26,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:26,853 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-26 23:40:26,854 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-10-26 23:40:26,855 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:26,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:26,859 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:26,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:26,874 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:26,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:26,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:26,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:26,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:40:26,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:26,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:40:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:26,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:27,298 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 23:40:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:40:27,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:40:27,540 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:27,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-10-26 23:40:27,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:27,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:40:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:40:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-10-26 23:40:27,541 INFO L87 Difference]: Start difference. First operand 893 states and 1461 transitions. Second operand 8 states. [2018-10-26 23:40:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:28,152 INFO L93 Difference]: Finished difference Result 953 states and 1541 transitions. [2018-10-26 23:40:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:40:28,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-26 23:40:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:28,162 INFO L225 Difference]: With dead ends: 953 [2018-10-26 23:40:28,162 INFO L226 Difference]: Without dead ends: 951 [2018-10-26 23:40:28,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-10-26 23:40:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-10-26 23:40:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 899. [2018-10-26 23:40:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-26 23:40:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1459 transitions. [2018-10-26 23:40:28,402 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1459 transitions. Word has length 33 [2018-10-26 23:40:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:28,403 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1459 transitions. [2018-10-26 23:40:28,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:40:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1459 transitions. [2018-10-26 23:40:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 23:40:28,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:28,405 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-10-26 23:40:28,405 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:28,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-10-26 23:40:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:28,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:28,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:40:29,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:29,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:29,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-26 23:40:29,025 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-10-26 23:40:29,026 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:29,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:29,032 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:29,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:29,053 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:29,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:29,073 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:29,114 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 79.08% of their original sizes. [2018-10-26 23:40:29,114 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:29,221 INFO L415 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-10-26 23:40:29,221 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:29,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:29,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-26 23:40:29,221 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:29,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:40:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:40:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:40:29,222 INFO L87 Difference]: Start difference. First operand 899 states and 1459 transitions. Second operand 12 states. [2018-10-26 23:40:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:32,521 INFO L93 Difference]: Finished difference Result 984 states and 1581 transitions. [2018-10-26 23:40:32,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 23:40:32,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-10-26 23:40:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:32,528 INFO L225 Difference]: With dead ends: 984 [2018-10-26 23:40:32,528 INFO L226 Difference]: Without dead ends: 982 [2018-10-26 23:40:32,529 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-10-26 23:40:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-10-26 23:40:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 888. [2018-10-26 23:40:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-26 23:40:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1427 transitions. [2018-10-26 23:40:32,741 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1427 transitions. Word has length 43 [2018-10-26 23:40:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:32,742 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1427 transitions. [2018-10-26 23:40:32,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:40:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1427 transitions. [2018-10-26 23:40:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 23:40:32,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:32,745 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-10-26 23:40:32,745 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:32,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1887033901, now seen corresponding path program 1 times [2018-10-26 23:40:32,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:32,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:32,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:32,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:32,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 23:40:32,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:32,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:32,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-26 23:40:32,891 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-10-26 23:40:32,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:32,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:32,897 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:32,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:32,912 INFO L272 AbstractInterpreter]: Visited 30 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-26 23:40:32,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:32,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:32,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:32,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:40:32,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:32,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:40:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:32,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 23:40:33,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 23:40:33,239 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:33,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 11 [2018-10-26 23:40:33,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:33,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:40:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:40:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:40:33,240 INFO L87 Difference]: Start difference. First operand 888 states and 1427 transitions. Second operand 4 states. [2018-10-26 23:40:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:33,390 INFO L93 Difference]: Finished difference Result 1039 states and 1656 transitions. [2018-10-26 23:40:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:40:33,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-26 23:40:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:33,395 INFO L225 Difference]: With dead ends: 1039 [2018-10-26 23:40:33,396 INFO L226 Difference]: Without dead ends: 680 [2018-10-26 23:40:33,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:40:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-26 23:40:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2018-10-26 23:40:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-26 23:40:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1076 transitions. [2018-10-26 23:40:33,580 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1076 transitions. Word has length 43 [2018-10-26 23:40:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:33,583 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 1076 transitions. [2018-10-26 23:40:33,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:40:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1076 transitions. [2018-10-26 23:40:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:40:33,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:33,584 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-10-26 23:40:33,584 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:33,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1269153316, now seen corresponding path program 1 times [2018-10-26 23:40:33,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:33,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:33,585 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 23:40:33,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:33,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:33,649 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-26 23:40:33,649 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-10-26 23:40:33,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:33,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:33,654 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:33,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:33,669 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-10-26 23:40:33,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:33,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:33,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:33,676 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:33,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:33,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:33,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:40:33,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:40:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:33,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-10-26 23:40:33,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:33,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:40:33,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:40:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:40:33,815 INFO L87 Difference]: Start difference. First operand 680 states and 1076 transitions. Second operand 7 states. [2018-10-26 23:40:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:34,140 INFO L93 Difference]: Finished difference Result 690 states and 1084 transitions. [2018-10-26 23:40:34,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:40:34,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-26 23:40:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:34,148 INFO L225 Difference]: With dead ends: 690 [2018-10-26 23:40:34,149 INFO L226 Difference]: Without dead ends: 688 [2018-10-26 23:40:34,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:40:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-26 23:40:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 682. [2018-10-26 23:40:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-10-26 23:40:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1075 transitions. [2018-10-26 23:40:34,313 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1075 transitions. Word has length 45 [2018-10-26 23:40:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:34,314 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 1075 transitions. [2018-10-26 23:40:34,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:40:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1075 transitions. [2018-10-26 23:40:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 23:40:34,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:34,315 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-10-26 23:40:34,315 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:34,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash -893792404, now seen corresponding path program 1 times [2018-10-26 23:40:34,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:34,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:34,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 23:40:34,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:34,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:34,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-26 23:40:34,403 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-10-26 23:40:34,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:34,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:34,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:34,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:34,426 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-10-26 23:40:34,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:34,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:34,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:34,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:34,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:34,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 23:40:34,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 23:40:34,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:40:34,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-10-26 23:40:34,655 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:40:34,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 23:40:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 23:40:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:40:34,656 INFO L87 Difference]: Start difference. First operand 682 states and 1075 transitions. Second operand 11 states. [2018-10-26 23:40:35,529 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 23:40:35,880 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-26 23:40:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:37,137 INFO L93 Difference]: Finished difference Result 1359 states and 2199 transitions. [2018-10-26 23:40:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 23:40:37,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-10-26 23:40:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:37,143 INFO L225 Difference]: With dead ends: 1359 [2018-10-26 23:40:37,143 INFO L226 Difference]: Without dead ends: 1035 [2018-10-26 23:40:37,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-26 23:40:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-10-26 23:40:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 806. [2018-10-26 23:40:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-26 23:40:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1291 transitions. [2018-10-26 23:40:37,334 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1291 transitions. Word has length 50 [2018-10-26 23:40:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:37,334 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1291 transitions. [2018-10-26 23:40:37,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 23:40:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1291 transitions. [2018-10-26 23:40:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 23:40:37,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:37,338 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-10-26 23:40:37,338 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:37,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash -254314127, now seen corresponding path program 1 times [2018-10-26 23:40:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:37,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:40:37,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:37,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:37,452 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-26 23:40:37,452 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-10-26 23:40:37,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:37,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:37,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:37,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:37,475 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-10-26 23:40:37,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:37,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:37,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:37,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:37,541 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 23:40:37,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 23:40:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:40:38,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-10-26 23:40:38,010 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:40:38,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:40:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:40:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:40:38,011 INFO L87 Difference]: Start difference. First operand 806 states and 1291 transitions. Second operand 14 states. [2018-10-26 23:40:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:39,847 INFO L93 Difference]: Finished difference Result 1054 states and 1688 transitions. [2018-10-26 23:40:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 23:40:39,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-10-26 23:40:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:39,853 INFO L225 Difference]: With dead ends: 1054 [2018-10-26 23:40:39,853 INFO L226 Difference]: Without dead ends: 1052 [2018-10-26 23:40:39,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-10-26 23:40:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-26 23:40:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 824. [2018-10-26 23:40:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-10-26 23:40:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1317 transitions. [2018-10-26 23:40:40,057 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1317 transitions. Word has length 60 [2018-10-26 23:40:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:40,057 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1317 transitions. [2018-10-26 23:40:40,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:40:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1317 transitions. [2018-10-26 23:40:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 23:40:40,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:40,062 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-10-26 23:40:40,062 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:40,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1004327087, now seen corresponding path program 1 times [2018-10-26 23:40:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:40,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:40,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:40:40,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:40,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:40,218 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-26 23:40:40,219 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-10-26 23:40:40,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:40,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:40,223 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:40,360 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:40,361 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-10-26 23:40:40,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:40,403 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:40,462 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 76.37% of their original sizes. [2018-10-26 23:40:40,463 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:40,838 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-10-26 23:40:40,838 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:40,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:40,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-10-26 23:40:40,838 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:40,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 23:40:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 23:40:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:40:40,839 INFO L87 Difference]: Start difference. First operand 824 states and 1317 transitions. Second operand 16 states. [2018-10-26 23:40:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:47,677 INFO L93 Difference]: Finished difference Result 1475 states and 2366 transitions. [2018-10-26 23:40:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-26 23:40:47,678 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-26 23:40:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:47,683 INFO L225 Difference]: With dead ends: 1475 [2018-10-26 23:40:47,683 INFO L226 Difference]: Without dead ends: 1052 [2018-10-26 23:40:47,686 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 23:40:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-26 23:40:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 966. [2018-10-26 23:40:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-26 23:40:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1544 transitions. [2018-10-26 23:40:47,957 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1544 transitions. Word has length 60 [2018-10-26 23:40:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:47,957 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1544 transitions. [2018-10-26 23:40:47,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 23:40:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1544 transitions. [2018-10-26 23:40:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 23:40:47,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:47,962 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-10-26 23:40:47,962 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:47,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash -283854137, now seen corresponding path program 1 times [2018-10-26 23:40:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:47,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:47,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:40:48,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:48,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:48,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-26 23:40:48,078 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-10-26 23:40:48,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:48,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:48,082 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:48,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:48,112 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-10-26 23:40:48,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:48,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:48,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:48,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:48,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:48,125 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:48,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-26 23:40:48,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:40:48,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:40:48,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-10-26 23:40:48,291 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:48,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:40:48,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:40:48,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:40:48,292 INFO L87 Difference]: Start difference. First operand 966 states and 1544 transitions. Second operand 6 states. [2018-10-26 23:40:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:48,815 INFO L93 Difference]: Finished difference Result 1860 states and 2967 transitions. [2018-10-26 23:40:48,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:40:48,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-10-26 23:40:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:48,821 INFO L225 Difference]: With dead ends: 1860 [2018-10-26 23:40:48,821 INFO L226 Difference]: Without dead ends: 971 [2018-10-26 23:40:48,826 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-10-26 23:40:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-26 23:40:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 914. [2018-10-26 23:40:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-26 23:40:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1448 transitions. [2018-10-26 23:40:49,039 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1448 transitions. Word has length 69 [2018-10-26 23:40:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:49,039 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1448 transitions. [2018-10-26 23:40:49,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:40:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1448 transitions. [2018-10-26 23:40:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 23:40:49,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:49,041 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-10-26 23:40:49,041 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:49,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1790518670, now seen corresponding path program 1 times [2018-10-26 23:40:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:49,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-26 23:40:49,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:49,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:49,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-26 23:40:49,271 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-10-26 23:40:49,272 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:49,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:49,275 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:49,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:40:49,300 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-10-26 23:40:49,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:49,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:40:49,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:49,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:40:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:49,311 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:40:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:49,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:40:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:40:49,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:40:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:40:49,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:40:49,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2018-10-26 23:40:49,844 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:40:49,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 23:40:49,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 23:40:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2018-10-26 23:40:49,845 INFO L87 Difference]: Start difference. First operand 914 states and 1448 transitions. Second operand 16 states. [2018-10-26 23:40:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:40:51,816 INFO L93 Difference]: Finished difference Result 1323 states and 2089 transitions. [2018-10-26 23:40:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:40:51,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-10-26 23:40:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:40:51,822 INFO L225 Difference]: With dead ends: 1323 [2018-10-26 23:40:51,822 INFO L226 Difference]: Without dead ends: 1321 [2018-10-26 23:40:51,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=931, Unknown=1, NotChecked=0, Total=1190 [2018-10-26 23:40:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-10-26 23:40:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1054. [2018-10-26 23:40:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-26 23:40:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1685 transitions. [2018-10-26 23:40:52,116 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1685 transitions. Word has length 72 [2018-10-26 23:40:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:40:52,116 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1685 transitions. [2018-10-26 23:40:52,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 23:40:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1685 transitions. [2018-10-26 23:40:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 23:40:52,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:40:52,118 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-10-26 23:40:52,118 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:40:52,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash -71103634, now seen corresponding path program 1 times [2018-10-26 23:40:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:40:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:40:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:40:52,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:40:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-26 23:40:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:40:52,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:40:52,213 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-26 23:40:52,213 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-10-26 23:40:52,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:40:52,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:40:52,218 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:40:52,375 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:40:52,375 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-10-26 23:40:52,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:40:52,406 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:40:52,466 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 77.38% of their original sizes. [2018-10-26 23:40:52,466 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:40:52,690 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-10-26 23:40:52,691 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:40:52,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:40:52,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2018-10-26 23:40:52,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:40:52,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 23:40:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 23:40:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:40:52,692 INFO L87 Difference]: Start difference. First operand 1054 states and 1685 transitions. Second operand 18 states. [2018-10-26 23:41:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:41:00,986 INFO L93 Difference]: Finished difference Result 1759 states and 2796 transitions. [2018-10-26 23:41:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-26 23:41:00,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-10-26 23:41:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:41:00,993 INFO L225 Difference]: With dead ends: 1759 [2018-10-26 23:41:00,993 INFO L226 Difference]: Without dead ends: 1270 [2018-10-26 23:41:00,997 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2018-10-26 23:41:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-26 23:41:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1066. [2018-10-26 23:41:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-26 23:41:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1694 transitions. [2018-10-26 23:41:01,350 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1694 transitions. Word has length 72 [2018-10-26 23:41:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:41:01,351 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1694 transitions. [2018-10-26 23:41:01,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 23:41:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1694 transitions. [2018-10-26 23:41:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 23:41:01,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:41:01,354 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-10-26 23:41:01,354 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:41:01,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:41:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash -217479284, now seen corresponding path program 1 times [2018-10-26 23:41:01,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:41:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:01,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:41:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:01,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:41:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-26 23:41:01,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:01,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:41:01,527 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-26 23:41:01,528 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-10-26 23:41:01,529 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:41:01,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:41:01,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:41:01,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:41:01,560 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-10-26 23:41:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:41:01,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:41:01,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:01,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:41:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:41:01,594 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:41:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:01,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:41:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-26 23:41:01,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:41:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-26 23:41:01,725 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:41:01,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-10-26 23:41:01,725 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:41:01,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:41:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:41:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:41:01,726 INFO L87 Difference]: Start difference. First operand 1066 states and 1694 transitions. Second operand 7 states. [2018-10-26 23:41:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:41:02,147 INFO L93 Difference]: Finished difference Result 1166 states and 1830 transitions. [2018-10-26 23:41:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:41:02,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-26 23:41:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:41:02,153 INFO L225 Difference]: With dead ends: 1166 [2018-10-26 23:41:02,153 INFO L226 Difference]: Without dead ends: 1164 [2018-10-26 23:41:02,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-26 23:41:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-10-26 23:41:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1086. [2018-10-26 23:41:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-26 23:41:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1709 transitions. [2018-10-26 23:41:02,418 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1709 transitions. Word has length 79 [2018-10-26 23:41:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:41:02,419 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1709 transitions. [2018-10-26 23:41:02,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:41:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1709 transitions. [2018-10-26 23:41:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 23:41:02,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:41:02,423 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-10-26 23:41:02,423 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:41:02,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:41:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133516, now seen corresponding path program 1 times [2018-10-26 23:41:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:41:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:41:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:02,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:41:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-26 23:41:02,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:02,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:41:02,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-10-26 23:41:02,552 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-10-26 23:41:02,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:41:02,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:41:02,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:41:02,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:41:02,632 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-10-26 23:41:02,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:41:02,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:41:02,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:02,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:41:02,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:41:02,655 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:41:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:02,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:41:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-26 23:41:02,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:41:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-26 23:41:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:41:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2018-10-26 23:41:02,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:41:02,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 23:41:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 23:41:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:41:02,857 INFO L87 Difference]: Start difference. First operand 1086 states and 1709 transitions. Second operand 13 states. [2018-10-26 23:41:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:41:04,309 INFO L93 Difference]: Finished difference Result 1851 states and 3014 transitions. [2018-10-26 23:41:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 23:41:04,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-26 23:41:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:41:04,318 INFO L225 Difference]: With dead ends: 1851 [2018-10-26 23:41:04,318 INFO L226 Difference]: Without dead ends: 1849 [2018-10-26 23:41:04,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-10-26 23:41:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-10-26 23:41:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1098. [2018-10-26 23:41:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-10-26 23:41:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1718 transitions. [2018-10-26 23:41:04,594 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1718 transitions. Word has length 86 [2018-10-26 23:41:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:41:04,595 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1718 transitions. [2018-10-26 23:41:04,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 23:41:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1718 transitions. [2018-10-26 23:41:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 23:41:04,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:41:04,599 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-10-26 23:41:04,599 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:41:04,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:41:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 2 times [2018-10-26 23:41:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:41:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:41:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:41:04,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:41:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-26 23:41:05,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:05,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:41:05,545 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:41:05,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:41:05,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:41:05,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/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-10-26 23:41:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:41:05,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 23:41:05,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 23:41:05,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:41:05,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:41:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-26 23:41:05,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:41:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-26 23:41:05,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:41:05,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-10-26 23:41:05,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:41:05,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:41:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:41:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-10-26 23:41:05,836 INFO L87 Difference]: Start difference. First operand 1098 states and 1718 transitions. Second operand 14 states. [2018-10-26 23:41:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:41:06,542 INFO L93 Difference]: Finished difference Result 1238 states and 1922 transitions. [2018-10-26 23:41:06,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 23:41:06,543 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-10-26 23:41:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:41:06,544 INFO L225 Difference]: With dead ends: 1238 [2018-10-26 23:41:06,544 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:41:06,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-10-26 23:41:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:41:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:41:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:41:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:41:06,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-10-26 23:41:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:41:06,550 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:41:06,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:41:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:41:06,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:41:06,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:41:06,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:06,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:07,546 WARN L179 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-26 23:41:08,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:08,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:08,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:08,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,336 WARN L179 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 457 DAG size of output: 426 [2018-10-26 23:41:09,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,946 WARN L179 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-26 23:41:09,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:09,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,858 WARN L179 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 462 DAG size of output: 438 [2018-10-26 23:41:10,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:10,983 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 227 [2018-10-26 23:41:11,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,712 WARN L179 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 373 [2018-10-26 23:41:11,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:11,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,221 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 286 [2018-10-26 23:41:12,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:12,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,228 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 484 DAG size of output: 431 [2018-10-26 23:41:13,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:13,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,104 WARN L179 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 632 DAG size of output: 455 [2018-10-26 23:41:14,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,967 WARN L179 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 521 DAG size of output: 479 [2018-10-26 23:41:14,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:14,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:15,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,073 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 728 DAG size of output: 545 [2018-10-26 23:41:16,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:41:16,460 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 266 [2018-10-26 23:41:18,638 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-26 23:41:23,928 WARN L179 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 424 DAG size of output: 75 [2018-10-26 23:41:25,616 WARN L179 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-26 23:41:29,312 WARN L179 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 435 DAG size of output: 91 [2018-10-26 23:41:30,805 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-26 23:41:32,268 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 220 DAG size of output: 61 [2018-10-26 23:41:34,469 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 350 DAG size of output: 68 [2018-10-26 23:41:35,968 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-26 23:41:37,673 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 268 DAG size of output: 69 [2018-10-26 23:41:40,553 WARN L179 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 421 DAG size of output: 70 [2018-10-26 23:41:42,079 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 219 DAG size of output: 61 [2018-10-26 23:41:45,443 WARN L179 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 423 DAG size of output: 71 [2018-10-26 23:41:49,321 WARN L179 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 470 DAG size of output: 83 [2018-10-26 23:41:53,231 WARN L179 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 508 DAG size of output: 59 [2018-10-26 23:41:55,260 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 254 DAG size of output: 81 [2018-10-26 23:41:55,262 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 23:41:55,262 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:41:55,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:41:55,263 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 23:41:55,263 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:41:55,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:41:55,263 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-10-26 23:41:55,263 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-10-26 23:41:55,263 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-10-26 23:41:55,264 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-10-26 23:41:55,264 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-10-26 23:41:55,264 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-10-26 23:41:55,264 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-10-26 23:41:55,264 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-10-26 23:41:55,264 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-10-26 23:41:55,264 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-26 23:41:55,265 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-10-26 23:41:55,265 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-26 23:41:55,265 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-10-26 23:41:55,265 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-10-26 23:41:55,265 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-10-26 23:41:55,265 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-10-26 23:41:55,266 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-10-26 23:41:55,266 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-10-26 23:41:55,266 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-10-26 23:41:55,266 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-26 23:41:55,266 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-10-26 23:41:55,267 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-10-26 23:41:55,269 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-10-26 23:41:55,269 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-10-26 23:41:55,269 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 23:41:55,269 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-26 23:41:55,269 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-10-26 23:41:55,270 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-10-26 23:41:55,270 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-10-26 23:41:55,270 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-26 23:41:55,270 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-26 23:41:55,270 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-10-26 23:41:55,270 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-26 23:41:55,270 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-26 23:41:55,271 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-26 23:41:55,271 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-26 23:41:55,271 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-26 23:41:55,271 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-26 23:41:55,271 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-26 23:41:55,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,332 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:41:55 BoogieIcfgContainer [2018-10-26 23:41:55,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:41:55,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:41:55,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:41:55,352 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:41:55,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:59" (3/4) ... [2018-10-26 23:41:55,357 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:41:55,364 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:41:55,364 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:41:55,364 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-26 23:41:55,369 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-10-26 23:41:55,369 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 23:41:55,369 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 23:41:55,369 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 23:41:55,393 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-10-26 23:41:55,412 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bfaa96cf-25d0-4919-aa0d-55358a9c9fee/bin-2019/utaipan/witness.graphml [2018-10-26 23:41:55,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:41:55,413 INFO L168 Benchmark]: Toolchain (without parser) took 116513.97 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 788.0 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 621.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:41:55,414 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:41:55,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.94 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:41:55,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.08 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:41:55,415 INFO L168 Benchmark]: Boogie Preprocessor took 30.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:41:55,415 INFO L168 Benchmark]: RCFGBuilder took 599.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-10-26 23:41:55,415 INFO L168 Benchmark]: TraceAbstraction took 115543.89 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 632.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:41:55,416 INFO L168 Benchmark]: Witness Printer took 60.16 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:41:55,418 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.94 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 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 24.08 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 599.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 115543.89 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 632.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 60.16 ms. Allocated memory is still 1.8 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-10-26 23:41:55,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,442 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-26 23:41:55,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-26 23:41:55,452 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, 115.3s OverallTime, 23 OverallIterations, 14 TraceHistogramMax, 49.4s AutomataDifference, 0.0s DeadEndRemovalTime, 48.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1720 SDtfs, 2109 SDslu, 6453 SDs, 0 SdLazy, 7636 SolverSat, 4246 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2040 GetRequests, 1578 SyntacticMatches, 22 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 12.7s 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, 1.4s AbstIntTime, 19 AbstIntIterations, 7 AbstIntStrong, 0.8741993136974552 AbsIntWeakeningRatio, 0.6988847583643123 AbsIntAvgWeakeningVarsNumRemoved, 14.680297397769516 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 1910 PreInvPairs, 2495 NumberOfFragments, 4392 HoareAnnotationTreeSize, 1910 FomulaSimplifications, 70464259599 FormulaSimplificationTreeSizeReduction, 9.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 19098922446 FormulaSimplificationTreeSizeReductionInter, 38.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s 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...