./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_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-27 00:38:19,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:38:19,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:38:19,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:38:19,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:38:19,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:38:19,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:38:19,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:38:19,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:38:19,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:38:19,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:38:19,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:38:19,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:38:19,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:38:19,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:38:19,873 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:38:19,874 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:38:19,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:38:19,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:38:19,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:38:19,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:38:19,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:38:19,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:38:19,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:38:19,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:38:19,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:38:19,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:38:19,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:38:19,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:38:19,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:38:19,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:38:19,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:38:19,888 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:38:19,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:38:19,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:38:19,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:38:19,889 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-27 00:38:19,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:38:19,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:38:19,902 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:38:19,902 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:38:19,902 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:38:19,903 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:38:19,903 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 00:38:19,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:38:19,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:38:19,904 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:38:19,904 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:38:19,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:38:19,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:38:19,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:38:19,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:38:19,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:38:19,906 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:38:19,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:38:19,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:38:19,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:38:19,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:38:19,907 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 00:38:19,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:38:19,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:38:19,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-10-27 00:38:19,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:38:19,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:38:19,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:38:19,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:38:19,950 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:38:19,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 00:38:19,991 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/data/364c2c36b/c6560e0dc66449ae9257b0cf96ca0019/FLAGa7c56999c [2018-10-27 00:38:20,357 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:38:20,357 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 00:38:20,363 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/data/364c2c36b/c6560e0dc66449ae9257b0cf96ca0019/FLAGa7c56999c [2018-10-27 00:38:20,374 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/data/364c2c36b/c6560e0dc66449ae9257b0cf96ca0019 [2018-10-27 00:38:20,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:38:20,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:38:20,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:38:20,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:38:20,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:38:20,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4ac005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20, skipping insertion in model container [2018-10-27 00:38:20,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:38:20,412 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:38:20,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:38:20,550 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:38:20,566 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:38:20,578 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:38:20,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20 WrapperNode [2018-10-27 00:38:20,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:38:20,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:38:20,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:38:20,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:38:20,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... [2018-10-27 00:38:20,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:38:20,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:38:20,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:38:20,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:38:20,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:38:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:38:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:38:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 00:38:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:38:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:38:21,073 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:38:21,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:38:21 BoogieIcfgContainer [2018-10-27 00:38:21,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:38:21,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:38:21,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:38:21,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:38:21,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:38:20" (1/3) ... [2018-10-27 00:38:21,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275f33be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:38:21, skipping insertion in model container [2018-10-27 00:38:21,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:38:20" (2/3) ... [2018-10-27 00:38:21,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275f33be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:38:21, skipping insertion in model container [2018-10-27 00:38:21,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:38:21" (3/3) ... [2018-10-27 00:38:21,080 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-10-27 00:38:21,089 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:38:21,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:38:21,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:38:21,134 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 00:38:21,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:38:21,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:38:21,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:38:21,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:38:21,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:38:21,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:38:21,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:38:21,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:38:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-27 00:38:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 00:38:21,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:21,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:21,160 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:21,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-10-27 00:38:21,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:21,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:21,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:21,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:21,277 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-27 00:38:21,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:38:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 00:38:21,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 00:38:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 00:38:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:38:21,297 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-27 00:38:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:21,322 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-27 00:38:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 00:38:21,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-27 00:38:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:21,335 INFO L225 Difference]: With dead ends: 83 [2018-10-27 00:38:21,335 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 00:38:21,338 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-27 00:38:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 00:38:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 00:38:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 00:38:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-10-27 00:38:21,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-10-27 00:38:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:21,388 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-10-27 00:38:21,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 00:38:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-10-27 00:38:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 00:38:21,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:21,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:21,389 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-10-27 00:38:21,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:21,527 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-27 00:38:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:38:21,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:38:21,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:38:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:38:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:38:21,530 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-10-27 00:38:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:22,077 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-10-27 00:38:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:38:22,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 00:38:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:22,079 INFO L225 Difference]: With dead ends: 77 [2018-10-27 00:38:22,079 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 00:38:22,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-27 00:38:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 00:38:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-10-27 00:38:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 00:38:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-10-27 00:38:22,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-10-27 00:38:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:22,098 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-10-27 00:38:22,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:38:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-10-27 00:38:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 00:38:22,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:22,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:22,100 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:22,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:22,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-10-27 00:38:22,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:22,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:22,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:22,182 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-27 00:38:22,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:38:22,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:38:22,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:38:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:38:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:38:22,183 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-10-27 00:38:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:22,629 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-10-27 00:38:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:38:22,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 00:38:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:22,633 INFO L225 Difference]: With dead ends: 121 [2018-10-27 00:38:22,633 INFO L226 Difference]: Without dead ends: 119 [2018-10-27 00:38:22,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:38:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-27 00:38:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-10-27 00:38:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 00:38:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-10-27 00:38:22,657 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-10-27 00:38:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:22,657 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-10-27 00:38:22,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:38:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-10-27 00:38:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 00:38:22,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:22,658 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-27 00:38:22,659 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:22,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-10-27 00:38:22,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:22,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:22,757 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-27 00:38:22,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:22,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:22,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:22,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:23,030 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-27 00:38:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:38:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-10-27 00:38:23,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 00:38:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 00:38:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:38:23,054 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 12 states. [2018-10-27 00:38:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:24,245 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2018-10-27 00:38:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:38:24,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-27 00:38:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:24,250 INFO L225 Difference]: With dead ends: 245 [2018-10-27 00:38:24,251 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 00:38:24,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:38:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 00:38:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2018-10-27 00:38:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-27 00:38:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 323 transitions. [2018-10-27 00:38:24,294 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 323 transitions. Word has length 21 [2018-10-27 00:38:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:24,294 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 323 transitions. [2018-10-27 00:38:24,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 00:38:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 323 transitions. [2018-10-27 00:38:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 00:38:24,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:24,296 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-27 00:38:24,296 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:24,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-10-27 00:38:24,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:24,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:24,460 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-27 00:38:24,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:24,460 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:24,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:24,510 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-27 00:38:24,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:24,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-10-27 00:38:24,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:38:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:38:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:38:24,537 INFO L87 Difference]: Start difference. First operand 202 states and 323 transitions. Second operand 9 states. [2018-10-27 00:38:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:25,492 INFO L93 Difference]: Finished difference Result 260 states and 408 transitions. [2018-10-27 00:38:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 00:38:25,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-27 00:38:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:25,495 INFO L225 Difference]: With dead ends: 260 [2018-10-27 00:38:25,495 INFO L226 Difference]: Without dead ends: 258 [2018-10-27 00:38:25,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:38:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-27 00:38:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2018-10-27 00:38:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-27 00:38:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2018-10-27 00:38:25,538 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 28 [2018-10-27 00:38:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:25,538 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2018-10-27 00:38:25,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:38:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2018-10-27 00:38:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 00:38:25,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:25,540 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-27 00:38:25,540 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:25,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-10-27 00:38:25,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:25,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:25,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:25,617 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-27 00:38:25,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:25,617 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:25,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:25,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:25,664 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-27 00:38:25,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:25,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-10-27 00:38:25,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:38:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:38:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:38:25,681 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand 9 states. [2018-10-27 00:38:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:26,424 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2018-10-27 00:38:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:38:26,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-10-27 00:38:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:26,430 INFO L225 Difference]: With dead ends: 317 [2018-10-27 00:38:26,430 INFO L226 Difference]: Without dead ends: 315 [2018-10-27 00:38:26,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:38:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-27 00:38:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2018-10-27 00:38:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-27 00:38:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 463 transitions. [2018-10-27 00:38:26,470 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 463 transitions. Word has length 31 [2018-10-27 00:38:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:26,470 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 463 transitions. [2018-10-27 00:38:26,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:38:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 463 transitions. [2018-10-27 00:38:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 00:38:26,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:26,473 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-27 00:38:26,473 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:26,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-10-27 00:38:26,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:26,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:26,546 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-27 00:38:26,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:26,546 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:38:26,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:26,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:26,837 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-27 00:38:26,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:38:26,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-10-27 00:38:26,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 00:38:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 00:38:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:38:26,854 INFO L87 Difference]: Start difference. First operand 288 states and 463 transitions. Second operand 14 states. [2018-10-27 00:38:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:28,034 INFO L93 Difference]: Finished difference Result 382 states and 598 transitions. [2018-10-27 00:38:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:38:28,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-27 00:38:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:28,038 INFO L225 Difference]: With dead ends: 382 [2018-10-27 00:38:28,038 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 00:38:28,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:38:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 00:38:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 337. [2018-10-27 00:38:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 00:38:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 531 transitions. [2018-10-27 00:38:28,085 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 531 transitions. Word has length 33 [2018-10-27 00:38:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:28,085 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 531 transitions. [2018-10-27 00:38:28,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 00:38:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 531 transitions. [2018-10-27 00:38:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 00:38:28,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:28,087 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:28,087 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:28,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1831965438, now seen corresponding path program 1 times [2018-10-27 00:38:28,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 00:38:28,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:28,249 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:38:28,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:28,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:38:28,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-10-27 00:38:28,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 00:38:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 00:38:28,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:38:28,335 INFO L87 Difference]: Start difference. First operand 337 states and 531 transitions. Second operand 10 states. [2018-10-27 00:38:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:28,691 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2018-10-27 00:38:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 00:38:28,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-10-27 00:38:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:28,698 INFO L225 Difference]: With dead ends: 351 [2018-10-27 00:38:28,698 INFO L226 Difference]: Without dead ends: 349 [2018-10-27 00:38:28,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:38:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-27 00:38:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-10-27 00:38:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-27 00:38:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2018-10-27 00:38:28,730 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 32 [2018-10-27 00:38:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:28,730 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2018-10-27 00:38:28,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 00:38:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2018-10-27 00:38:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 00:38:28,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:28,733 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-27 00:38:28,733 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:28,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-10-27 00:38:28,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:28,886 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-27 00:38:28,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:28,886 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:28,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:28,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:28,976 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-27 00:38:28,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-10-27 00:38:28,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 00:38:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 00:38:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-27 00:38:28,996 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand 13 states. [2018-10-27 00:38:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:29,799 INFO L93 Difference]: Finished difference Result 570 states and 913 transitions. [2018-10-27 00:38:29,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:38:29,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-10-27 00:38:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:29,815 INFO L225 Difference]: With dead ends: 570 [2018-10-27 00:38:29,815 INFO L226 Difference]: Without dead ends: 568 [2018-10-27 00:38:29,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:38:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-27 00:38:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 533. [2018-10-27 00:38:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-27 00:38:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2018-10-27 00:38:29,904 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 33 [2018-10-27 00:38:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:29,904 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2018-10-27 00:38:29,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 00:38:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2018-10-27 00:38:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 00:38:29,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:29,918 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-27 00:38:29,918 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:29,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-10-27 00:38:29,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:30,018 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-27 00:38:30,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:30,019 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:30,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:30,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:30,070 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-27 00:38:30,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:30,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-10-27 00:38:30,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 00:38:30,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 00:38:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:38:30,090 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand 10 states. [2018-10-27 00:38:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:30,607 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2018-10-27 00:38:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 00:38:30,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-10-27 00:38:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:30,616 INFO L225 Difference]: With dead ends: 609 [2018-10-27 00:38:30,616 INFO L226 Difference]: Without dead ends: 607 [2018-10-27 00:38:30,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:38:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-27 00:38:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2018-10-27 00:38:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-10-27 00:38:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2018-10-27 00:38:30,691 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 43 [2018-10-27 00:38:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:30,692 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2018-10-27 00:38:30,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 00:38:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2018-10-27 00:38:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 00:38:30,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:30,694 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2018-10-27 00:38:30,694 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:30,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash 351208904, now seen corresponding path program 1 times [2018-10-27 00:38:30,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:30,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:30,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 00:38:30,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:30,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:30,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:30,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 00:38:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-10-27 00:38:30,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 00:38:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 00:38:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:38:30,904 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand 10 states. [2018-10-27 00:38:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:31,300 INFO L93 Difference]: Finished difference Result 573 states and 918 transitions. [2018-10-27 00:38:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 00:38:31,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-10-27 00:38:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:31,306 INFO L225 Difference]: With dead ends: 573 [2018-10-27 00:38:31,306 INFO L226 Difference]: Without dead ends: 571 [2018-10-27 00:38:31,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:38:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-10-27 00:38:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2018-10-27 00:38:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-10-27 00:38:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 869 transitions. [2018-10-27 00:38:31,382 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 869 transitions. Word has length 44 [2018-10-27 00:38:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:31,383 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 869 transitions. [2018-10-27 00:38:31,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 00:38:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 869 transitions. [2018-10-27 00:38:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 00:38:31,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:31,385 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 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] [2018-10-27 00:38:31,385 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 506108398, now seen corresponding path program 1 times [2018-10-27 00:38:31,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:31,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-27 00:38:31,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:31,943 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:38:31,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:31,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:38:32,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:38:32,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-27 00:38:32,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 00:38:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 00:38:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 00:38:32,392 INFO L87 Difference]: Start difference. First operand 541 states and 869 transitions. Second operand 11 states. [2018-10-27 00:38:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:33,850 INFO L93 Difference]: Finished difference Result 1112 states and 1758 transitions. [2018-10-27 00:38:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 00:38:33,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-10-27 00:38:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:33,853 INFO L225 Difference]: With dead ends: 1112 [2018-10-27 00:38:33,853 INFO L226 Difference]: Without dead ends: 287 [2018-10-27 00:38:33,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-10-27 00:38:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-27 00:38:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 240. [2018-10-27 00:38:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-27 00:38:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2018-10-27 00:38:33,893 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 64 [2018-10-27 00:38:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:33,893 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2018-10-27 00:38:33,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 00:38:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2018-10-27 00:38:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 00:38:33,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:33,895 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:33,895 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:33,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash 653076176, now seen corresponding path program 1 times [2018-10-27 00:38:33,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:33,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:33,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-27 00:38:34,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:34,177 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 00:38:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:38:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:34,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-27 00:38:35,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:38:35,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2018-10-27 00:38:35,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 00:38:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 00:38:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 00:38:35,461 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand 11 states. [2018-10-27 00:38:36,097 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-10-27 00:38:36,264 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-27 00:38:38,111 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 00:38:40,700 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:38:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:38:56,868 INFO L93 Difference]: Finished difference Result 480 states and 693 transitions. [2018-10-27 00:38:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:38:56,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-10-27 00:38:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:38:56,870 INFO L225 Difference]: With dead ends: 480 [2018-10-27 00:38:56,870 INFO L226 Difference]: Without dead ends: 295 [2018-10-27 00:38:56,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=181, Invalid=560, Unknown=15, NotChecked=0, Total=756 [2018-10-27 00:38:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-27 00:38:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 203. [2018-10-27 00:38:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-27 00:38:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 287 transitions. [2018-10-27 00:38:56,903 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 287 transitions. Word has length 85 [2018-10-27 00:38:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:38:56,903 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 287 transitions. [2018-10-27 00:38:56,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 00:38:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 287 transitions. [2018-10-27 00:38:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-27 00:38:56,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:38:56,906 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:38:56,906 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:38:56,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 391410060, now seen corresponding path program 1 times [2018-10-27 00:38:56,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:38:56,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:38:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:56,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:38:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:38:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-10-27 00:38:57,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:38:57,568 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 00:38:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:38:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:57,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:38:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 212 proven. 9 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-10-27 00:38:57,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:38:57,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-27 00:38:57,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 00:38:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 00:38:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:38:57,903 INFO L87 Difference]: Start difference. First operand 203 states and 287 transitions. Second operand 14 states. [2018-10-27 00:39:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:03,874 INFO L93 Difference]: Finished difference Result 486 states and 710 transitions. [2018-10-27 00:39:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:39:03,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-10-27 00:39:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:03,878 INFO L225 Difference]: With dead ends: 486 [2018-10-27 00:39:03,878 INFO L226 Difference]: Without dead ends: 338 [2018-10-27 00:39:03,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2018-10-27 00:39:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-27 00:39:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 253. [2018-10-27 00:39:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-27 00:39:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 372 transitions. [2018-10-27 00:39:03,930 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 372 transitions. Word has length 120 [2018-10-27 00:39:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:03,930 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 372 transitions. [2018-10-27 00:39:03,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 00:39:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2018-10-27 00:39:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-27 00:39:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:03,934 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:39:03,934 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:03,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 825139146, now seen corresponding path program 1 times [2018-10-27 00:39:03,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:39:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:39:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 33 proven. 74 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-10-27 00:39:04,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:39:04,077 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:39:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:04,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:39:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-10-27 00:39:04,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:39:04,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-27 00:39:04,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 00:39:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 00:39:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-27 00:39:04,515 INFO L87 Difference]: Start difference. First operand 253 states and 372 transitions. Second operand 16 states. [2018-10-27 00:39:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:06,031 INFO L93 Difference]: Finished difference Result 429 states and 630 transitions. [2018-10-27 00:39:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 00:39:06,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2018-10-27 00:39:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:06,035 INFO L225 Difference]: With dead ends: 429 [2018-10-27 00:39:06,035 INFO L226 Difference]: Without dead ends: 427 [2018-10-27 00:39:06,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-10-27 00:39:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-27 00:39:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 340. [2018-10-27 00:39:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 00:39:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 506 transitions. [2018-10-27 00:39:06,108 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 506 transitions. Word has length 120 [2018-10-27 00:39:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:06,108 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 506 transitions. [2018-10-27 00:39:06,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 00:39:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 506 transitions. [2018-10-27 00:39:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 00:39:06,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:06,111 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:39:06,113 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:06,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -769027094, now seen corresponding path program 2 times [2018-10-27 00:39:06,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:39:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:39:06,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:06,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 41 proven. 92 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 00:39:06,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:39:06,348 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/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-27 00:39:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 00:39:06,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 00:39:06,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:39:06,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:39:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-10-27 00:39:06,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:39:06,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-10-27 00:39:06,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 00:39:06,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 00:39:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:39:06,647 INFO L87 Difference]: Start difference. First operand 340 states and 506 transitions. Second operand 20 states. [2018-10-27 00:39:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:12,880 INFO L93 Difference]: Finished difference Result 553 states and 813 transitions. [2018-10-27 00:39:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 00:39:12,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 142 [2018-10-27 00:39:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:12,881 INFO L225 Difference]: With dead ends: 553 [2018-10-27 00:39:12,881 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 00:39:12,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=493, Invalid=1759, Unknown=4, NotChecked=0, Total=2256 [2018-10-27 00:39:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 00:39:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 00:39:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 00:39:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 00:39:12,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2018-10-27 00:39:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:12,885 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 00:39:12,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 00:39:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 00:39:12,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 00:39:12,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 00:39:12,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:12,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:12,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,003 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2018-10-27 00:39:13,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,488 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 215 [2018-10-27 00:39:13,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:13,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,115 WARN L179 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 216 [2018-10-27 00:39:14,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,675 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 173 [2018-10-27 00:39:14,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,805 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 115 [2018-10-27 00:39:14,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:14,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:15,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:39:15,052 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 185 [2018-10-27 00:39:15,350 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 157 [2018-10-27 00:39:50,305 WARN L179 SmtUtils]: Spent 34.95 s on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2018-10-27 00:39:52,465 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 214 DAG size of output: 38 [2018-10-27 00:40:24,048 WARN L179 SmtUtils]: Spent 31.58 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-10-27 00:40:25,089 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 215 DAG size of output: 36 [2018-10-27 00:40:28,778 WARN L179 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2018-10-27 00:40:32,123 WARN L179 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2018-10-27 00:41:04,323 WARN L179 SmtUtils]: Spent 32.20 s on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2018-10-27 00:41:08,049 WARN L179 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2018-10-27 00:41:34,680 WARN L179 SmtUtils]: Spent 26.63 s on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2018-10-27 00:41:34,924 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 18 [2018-10-27 00:41:38,457 WARN L179 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2018-10-27 00:41:42,792 WARN L179 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 169 DAG size of output: 91 [2018-10-27 00:41:43,044 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 18 [2018-10-27 00:41:56,505 WARN L179 SmtUtils]: Spent 13.46 s on a formula simplification. DAG size of input: 182 DAG size of output: 88 [2018-10-27 00:42:12,075 WARN L179 SmtUtils]: Spent 15.53 s on a formula simplification. DAG size of input: 157 DAG size of output: 110 [2018-10-27 00:42:12,077 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 00:42:12,077 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:42:12,077 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:42:12,078 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 00:42:12,078 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 00:42:12,078 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:42:12,078 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse2 (* 2 main_~l~0))) (let ((.cse5 (<= main_~r~0 main_~n~0)) (.cse3 (exists ((main_~l~0 Int)) (let ((.cse10 (* 2 main_~l~0))) (and (<= main_~i~0 .cse10) (<= (+ .cse10 2) main_~n~0))))) (.cse7 (<= .cse2 main_~j~0)) (.cse8 (<= main_~j~0 .cse2)) (.cse9 (<= (+ .cse2 1) main_~n~0)) (.cse0 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse6 (<= 2 main_~r~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 (<= (+ .cse2 3) main_~n~0) .cse3 .cse4 (<= (+ .cse2 main_~r~0) (+ main_~j~0 main_~n~0)) .cse5 .cse6) (and .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 .cse5 .cse8 .cse6 .cse9) (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse1 .cse3 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22))) .cse4 (<= (+ .cse2 2) main_~n~0) .cse6) (and (<= (+ main_~i~0 1) main_~n~0) .cse7 .cse4 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse8 .cse6 .cse9) (and .cse0 (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse1 (<= (+ main_~r~0 1) main_~n~0) .cse4 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse6)))) [2018-10-27 00:42:12,078 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-10-27 00:42:12,079 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse9 (<= 1 main_~l~0)) (.cse4 (<= 1 main_~i~0)) (.cse12 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse6 (<= 2 main_~r~0)) (.cse10 (* 2 main_~l~0))) (let ((.cse7 (<= (+ .cse10 main_~r~0) (+ 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)))) (.cse1 (<= .cse10 main_~j~0)) (.cse0 (exists ((main_~l~0 Int)) (let ((.cse13 (* 2 main_~l~0))) (and (<= main_~i~0 .cse13) (<= (+ .cse13 2) main_~n~0))))) (.cse3 (<= (+ .cse10 2) main_~n~0)) (.cse2 (and (<= 2 main_~j~0) .cse9 .cse4 .cse12 (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) .cse6)) (.cse5 (<= main_~j~0 main_~n~0))) (or (and .cse0 .cse1 .cse2) (and (and .cse3 (and (exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)))) (and .cse4 (and .cse5 .cse6)) (<= (+ main_~r~0 2) (* 2 main_~j~0)))) .cse7 .cse8) (and (and (<= main_~r~0 main_~j~0) .cse9 .cse4 .cse5 .cse6) .cse1) (and .cse2 .cse7 .cse8 (<= (+ .cse10 3) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (let ((.cse11 (or (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse2 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (and (and (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse2) (<= main_~j~0 .cse10))))) (or (and .cse11 .cse1) (and .cse11 .cse0 .cse3))) (and .cse9 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse12 .cse5 (<= (+ main_~r~0 1) main_~n~0) .cse4 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse6)))) [2018-10-27 00:42:12,079 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse2 (* 2 main_~l~0))) (let ((.cse5 (<= main_~r~0 main_~n~0)) (.cse3 (exists ((main_~l~0 Int)) (let ((.cse10 (* 2 main_~l~0))) (and (<= main_~i~0 .cse10) (<= (+ .cse10 2) main_~n~0))))) (.cse7 (<= .cse2 main_~j~0)) (.cse8 (<= main_~j~0 .cse2)) (.cse9 (<= (+ .cse2 1) main_~n~0)) (.cse0 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse6 (<= 2 main_~r~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 (<= (+ .cse2 3) main_~n~0) .cse3 .cse4 (<= (+ .cse2 main_~r~0) (+ main_~j~0 main_~n~0)) .cse5 .cse6) (and .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 .cse5 .cse8 .cse6 .cse9) (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse1 .cse3 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22))) .cse4 (<= (+ .cse2 2) main_~n~0) .cse6) (and (<= (+ main_~i~0 1) main_~n~0) .cse7 .cse4 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse8 .cse6 .cse9) (and .cse0 (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse1 (<= (+ main_~r~0 1) main_~n~0) .cse4 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse6)))) [2018-10-27 00:42:12,079 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse8 (* 2 main_~l~0))) (let ((.cse2 (<= (+ .cse8 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse6 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (.cse4 (<= (+ .cse8 2) main_~n~0)) (.cse0 (<= 1 main_~l~0)) (.cse10 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse9 (exists ((main_~l~0 Int)) (let ((.cse14 (* 2 main_~l~0))) (and (<= main_~i~0 .cse14) (<= (+ .cse14 2) main_~n~0))))) (.cse11 (<= .cse8 main_~j~0)) (.cse1 (<= 1 main_~i~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse12 (<= main_~j~0 .cse8)) (.cse5 (<= 2 main_~r~0))) (or (and .cse0 (exists ((main_~l~0 Int) (v_main_~j~0_34 Int)) (and (<= 1 main_~l~0) (<= main_~i~0 v_main_~j~0_34) (<= (* 2 v_main_~j~0_34) main_~j~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_34))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (and (or (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= (* 2 v_main_~j~0_31) main_~j~0) (< 1 v_main_~l~0_22))) .cse1 .cse5 .cse6) (let ((.cse7 (exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)))))) (or (and .cse1 .cse7 (exists ((v_main_~l~0_21 Int) (v_main_~j~0_29 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) v_main_~j~0_29) (<= (* 2 v_main_~j~0_29) main_~j~0))) .cse5) (and (and .cse1 (exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28))) (< 0 main_~l~0)) .cse5) (and .cse1 .cse7 .cse5 (<= (+ main_~r~0 2) main_~j~0))))) (<= .cse8 main_~n~0)) .cse3) (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= (+ .cse8 3) main_~n~0) .cse9 .cse1 .cse2 .cse3 .cse5) (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse9 .cse6 .cse1 .cse4 .cse5) (and (<= (+ main_~i~0 1) main_~n~0) .cse10 .cse11 .cse1 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~l~0 1) main_~n~0) .cse3 .cse12 .cse5) (and .cse0 .cse1 .cse10 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 (<= (+ main_~r~0 1) main_~n~0)) (and .cse9 .cse11 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (exists ((main_~l~0 Int)) (let ((.cse13 (* 2 main_~l~0))) (and (<= (+ .cse13 2) main_~n~0) (<= main_~j~0 .cse13)))) .cse1 .cse3 .cse12 .cse5)))) [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse8 (* 2 main_~l~0))) (let ((.cse0 (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22)))) (.cse4 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (.cse6 (<= main_~r~0 main_~n~0)) (.cse1 (<= (+ main_~i~0 1) main_~n~0)) (.cse3 (<= .cse8 main_~j~0)) (.cse12 (<= main_~j~0 .cse8)) (.cse13 (<= (+ .cse8 1) main_~n~0)) (.cse11 (<= 1 main_~l~0)) (.cse14 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse2 (<= main_~j~0 main_~n~0)) (.cse9 (exists ((main_~l~0 Int)) (let ((.cse15 (* 2 main_~l~0))) (and (<= main_~i~0 .cse15) (<= (+ .cse15 2) main_~n~0))))) (.cse5 (<= 1 main_~i~0)) (.cse10 (<= (+ .cse8 2) main_~n~0)) (.cse7 (<= 2 main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 (and (<= main_~r~0 .cse8) (and .cse1 .cse5 .cse2 .cse7))) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7) (and .cse11 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse2 (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse7) (and .cse9 .cse3 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 .cse6 .cse12 .cse7 .cse13) (and .cse11 .cse14 .cse2 (<= (+ .cse8 3) main_~n~0) .cse9 .cse5 (<= (+ .cse8 main_~r~0) (+ main_~j~0 main_~n~0)) .cse6 .cse7) (and .cse1 .cse3 .cse5 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse12 .cse7 .cse13) (and (<= main_~r~0 main_~j~0) .cse11 .cse14 .cse2 .cse9 .cse5 .cse10 .cse7)))) [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-10-27 00:42:12,080 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse1 (<= (+ main_~i~0 1) main_~n~0)) (.cse0 (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22)))) (.cse4 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (.cse3 (<= .cse11 main_~j~0)) (.cse6 (<= main_~r~0 main_~n~0)) (.cse10 (<= 1 main_~l~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse2 (<= main_~j~0 main_~n~0)) (.cse8 (exists ((main_~l~0 Int)) (let ((.cse13 (* 2 main_~l~0))) (and (<= main_~i~0 .cse13) (<= (+ .cse13 2) main_~n~0))))) (.cse5 (<= 1 main_~i~0)) (.cse9 (<= (+ .cse11 2) main_~n~0)) (.cse7 (<= 2 main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (and .cse1 .cse5 (exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)))) .cse2 .cse7) .cse6 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse5 .cse9 .cse7) (and .cse10 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse2 (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse7) (and .cse8 .cse3 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 .cse6 (<= main_~j~0 .cse11) .cse7 (<= (+ .cse11 1) main_~n~0)) (and .cse10 .cse12 .cse2 (<= (+ .cse11 3) main_~n~0) .cse8 .cse5 (<= (+ .cse11 main_~r~0) (+ main_~j~0 main_~n~0)) .cse6 .cse7) (and (<= main_~r~0 main_~j~0) .cse10 .cse12 .cse2 .cse8 .cse5 .cse9 .cse7)))) [2018-10-27 00:42:12,081 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-10-27 00:42:12,081 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-10-27 00:42:12,081 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 00:42:12,081 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 00:42:12,081 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse2 (<= 2 main_~j~0)) (.cse3 (and (and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 2 main_~r~0)) (<= main_~r~0 main_~n~0))) (.cse4 (<= 2 main_~l~0))) (let ((.cse1 (and (and .cse2 .cse3) .cse4)) (.cse0 (* 2 main_~l~0))) (or (and (<= (+ .cse0 main_~r~0) (+ main_~j~0 main_~n~0)) (and .cse1 (<= .cse0 main_~n~0))) (and .cse2 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 .cse4 (<= (+ main_~r~0 1) main_~n~0)) (and (and .cse1 (<= main_~j~0 .cse0)) (<= .cse0 main_~j~0))))) [2018-10-27 00:42:12,081 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-27 00:42:12,081 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse4 (<= 2 main_~j~0)) (.cse5 (and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 2 main_~r~0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse2 (<= main_~r~0 main_~n~0)) (.cse0 (* 2 main_~l~0)) (.cse3 (+ main_~r~0 1))) (or (and (<= (+ .cse0 main_~r~0) (+ main_~j~0 main_~n~0)) (and .cse1 (<= .cse0 main_~n~0)) .cse2 (< 1 main_~l~0)) (and (and (<= main_~j~0 .cse0) (and (<= .cse3 .cse0) .cse1)) .cse2 (<= .cse0 main_~j~0)) (and (and .cse4 .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= .cse3 main_~n~0)) (<= 2 main_~l~0))))) [2018-10-27 00:42:12,081 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-10-27 00:42:12,082 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse8 (* 2 main_~l~0))) (let ((.cse0 (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22)))) (.cse4 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (.cse6 (<= main_~r~0 main_~n~0)) (.cse1 (<= (+ main_~i~0 1) main_~n~0)) (.cse3 (<= .cse8 main_~j~0)) (.cse12 (<= main_~j~0 .cse8)) (.cse13 (<= (+ .cse8 1) main_~n~0)) (.cse11 (<= 1 main_~l~0)) (.cse14 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse2 (<= main_~j~0 main_~n~0)) (.cse9 (exists ((main_~l~0 Int)) (let ((.cse15 (* 2 main_~l~0))) (and (<= main_~i~0 .cse15) (<= (+ .cse15 2) main_~n~0))))) (.cse5 (<= 1 main_~i~0)) (.cse10 (<= (+ .cse8 2) main_~n~0)) (.cse7 (<= 2 main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 (and (<= main_~r~0 .cse8) (and .cse1 .cse5 .cse2 .cse7))) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7) (and .cse11 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse2 (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse7) (and .cse9 .cse3 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 .cse6 .cse12 .cse7 .cse13) (and .cse11 .cse14 .cse2 (<= (+ .cse8 3) main_~n~0) .cse9 .cse5 (<= (+ .cse8 main_~r~0) (+ main_~j~0 main_~n~0)) .cse6 .cse7) (and .cse1 .cse3 .cse5 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse12 .cse7 .cse13) (and (<= main_~r~0 main_~j~0) .cse11 .cse14 .cse2 .cse9 .cse5 .cse10 .cse7)))) [2018-10-27 00:42:12,082 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse8 (* 2 main_~l~0))) (let ((.cse0 (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22)))) (.cse4 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22)))) (.cse6 (<= main_~r~0 main_~n~0)) (.cse1 (<= (+ main_~i~0 1) main_~n~0)) (.cse3 (<= .cse8 main_~j~0)) (.cse12 (<= main_~j~0 .cse8)) (.cse13 (<= (+ .cse8 1) main_~n~0)) (.cse11 (<= 1 main_~l~0)) (.cse14 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse2 (<= main_~j~0 main_~n~0)) (.cse9 (exists ((main_~l~0 Int)) (let ((.cse15 (* 2 main_~l~0))) (and (<= main_~i~0 .cse15) (<= (+ .cse15 2) main_~n~0))))) (.cse5 (<= 1 main_~i~0)) (.cse10 (<= (+ .cse8 2) main_~n~0)) (.cse7 (<= 2 main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 (and (<= main_~r~0 .cse8) (and .cse1 .cse5 .cse2 .cse7))) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7) (and .cse11 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse2 (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse7) (and .cse9 .cse3 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse5 .cse6 .cse12 .cse7 .cse13) (and .cse11 .cse14 .cse2 (<= (+ .cse8 3) main_~n~0) .cse9 .cse5 (<= (+ .cse8 main_~r~0) (+ main_~j~0 main_~n~0)) .cse6 .cse7) (and .cse1 .cse3 .cse5 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse12 .cse7 .cse13) (and (<= main_~r~0 main_~j~0) .cse11 .cse14 .cse2 .cse9 .cse5 .cse10 .cse7)))) [2018-10-27 00:42:12,082 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-27 00:42:12,082 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-27 00:42:12,082 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-10-27 00:42:12,082 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse2 (* 2 main_~l~0))) (let ((.cse5 (<= main_~r~0 main_~n~0)) (.cse7 (<= .cse2 main_~j~0)) (.cse8 (<= main_~j~0 .cse2)) (.cse9 (<= (+ .cse2 1) main_~n~0)) (.cse3 (exists ((main_~l~0 Int)) (let ((.cse10 (* 2 main_~l~0))) (and (<= main_~i~0 .cse10) (<= (+ .cse10 2) main_~n~0))))) (.cse0 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse6 (<= 2 main_~r~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 (<= (+ .cse2 3) main_~n~0) .cse3 .cse4 (<= (+ .cse2 main_~r~0) (+ main_~j~0 main_~n~0)) .cse5 .cse6) (and .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 .cse5 .cse8 .cse6 .cse9) (and (<= (+ main_~i~0 1) main_~n~0) .cse7 .cse4 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse8 .cse6 .cse9) (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse1 .cse3 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22))) .cse4 (<= (+ .cse2 2) main_~n~0) .cse6) (and .cse0 (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse1 (<= (+ main_~r~0 1) main_~n~0) .cse4 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse6)))) [2018-10-27 00:42:12,082 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse2 (* 2 main_~l~0))) (let ((.cse5 (<= main_~r~0 main_~n~0)) (.cse3 (exists ((main_~l~0 Int)) (let ((.cse10 (* 2 main_~l~0))) (and (<= main_~i~0 .cse10) (<= (+ .cse10 2) main_~n~0))))) (.cse7 (<= .cse2 main_~j~0)) (.cse8 (<= main_~j~0 .cse2)) (.cse9 (<= (+ .cse2 1) main_~n~0)) (.cse0 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse6 (<= 2 main_~r~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 (<= (+ .cse2 3) main_~n~0) .cse3 .cse4 (<= (+ .cse2 main_~r~0) (+ main_~j~0 main_~n~0)) .cse5 .cse6) (and .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 .cse5 .cse8 .cse6 .cse9) (and (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22))) .cse1 .cse3 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22))) .cse4 (<= (+ .cse2 2) main_~n~0) .cse6) (and (<= (+ main_~i~0 1) main_~n~0) .cse7 .cse4 (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse8 .cse6 .cse9) (and .cse0 (<= main_~l~0 (+ (div main_~n~0 2) 1)) .cse1 (<= (+ main_~r~0 1) main_~n~0) .cse4 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse6)))) [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse13 (<= main_~r~0 main_~n~0)) (.cse15 (<= 1 main_~l~0)) (.cse12 (<= 1 main_~i~0)) (.cse16 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse11 (<= main_~j~0 main_~n~0)) (.cse14 (<= 2 main_~r~0)) (.cse0 (* 2 main_~l~0))) (let ((.cse3 (exists ((main_~l~0 Int)) (let ((.cse18 (* 2 main_~l~0))) (and (<= main_~i~0 .cse18) (<= (+ .cse18 2) main_~n~0))))) (.cse6 (<= (+ .cse0 2) main_~n~0)) (.cse1 (let ((.cse17 (<= (+ main_~l~0 1) main_~n~0))) (or (and (<= main_~r~0 main_~j~0) .cse15 .cse12 .cse16 .cse17 .cse11 .cse14) (and (and .cse12 .cse16 .cse17 .cse11 .cse14) (exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)))) (<= (+ main_~r~0 2) (* 2 main_~j~0)))))) (.cse4 (and (<= 2 main_~j~0) .cse15 .cse12 .cse16 (<= (+ main_~j~0 1) main_~n~0) .cse13 .cse14)) (.cse10 (<= (+ .cse0 main_~r~0) (+ main_~j~0 main_~n~0))) (.cse9 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse7 (exists ((v_main_~l~0_22 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 1 v_main_~l~0_22)))) (.cse2 (<= .cse0 main_~j~0)) (.cse8 (exists ((v_main_~l~0_22 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_22)) (<= v_main_~l~0_22 (+ main_~l~0 1)) (< 1 v_main_~l~0_22))))) (or (and (and (<= main_~r~0 .cse0) .cse1) .cse2) (and .cse3 .cse2 .cse4) (let ((.cse5 (or (and .cse7 .cse4 .cse8) (and (exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0))) .cse4 (<= main_~j~0 .cse0))))) (or (and .cse5 .cse2) (and .cse5 .cse3 .cse6))) (and .cse9 (and .cse10 .cse6 .cse1)) (and .cse4 .cse10 .cse9 (<= (+ .cse0 3) main_~n~0) (<= (+ main_~i~0 2) main_~n~0)) (and .cse7 .cse11 .cse2 .cse8 .cse12 .cse13 .cse14) (and .cse15 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse16 .cse11 (<= (+ main_~r~0 1) main_~n~0) .cse12 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse14)))) [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-27 00:42:12,083 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-27 00:42:12,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,094 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,094 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,094 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,094 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,095 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,095 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,095 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,095 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,095 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,096 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,096 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,096 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,096 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,096 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,100 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,100 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,100 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,100 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,105 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:42:12 BoogieIcfgContainer [2018-10-27 00:42:12,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:42:12,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:42:12,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:42:12,129 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:42:12,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:38:21" (3/4) ... [2018-10-27 00:42:12,137 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 00:42:12,144 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 00:42:12,145 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 00:42:12,145 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-27 00:42:12,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-10-27 00:42:12,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 00:42:12,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 00:42:12,151 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 00:42:12,197 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= l && (\exists main_~l~0 : int, v_main_~j~0_34 : int :: ((1 <= main_~l~0 && i <= v_main_~j~0_34) && 2 * v_main_~j~0_34 <= j) && 2 * main_~l~0 + 1 <= v_main_~j~0_34)) && 1 <= i) && 2 * l + r <= j + n) && r <= n) && 2 * l + 2 <= n) && 2 <= r) || (((((((\exists v_main_~l~0_22 : int, main_~l~0 : int, v_main_~j~0_31 : int :: (((r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= main_~l~0 + 1) && 2 * main_~l~0 + 1 <= v_main_~j~0_31) && 2 * v_main_~j~0_31 <= j) && 1 < v_main_~l~0_22) && 1 <= i) && 2 <= r) && (\exists v_main_~l~0_22 : int :: (r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= l + 1) && 1 < v_main_~l~0_22)) || ((((1 <= i && (\exists v_main_~l~0_21 : int :: (1 < v_main_~l~0_21 && v_main_~l~0_21 <= l + 1) && r + 1 <= 2 * v_main_~l~0_21)) && (\exists v_main_~l~0_21 : int, v_main_~j~0_29 : int, main_~l~0 : int :: (((1 < v_main_~l~0_21 && v_main_~l~0_21 <= main_~l~0 + 1) && r + 1 <= 2 * v_main_~l~0_21) && 2 * main_~l~0 <= v_main_~j~0_29) && 2 * v_main_~j~0_29 <= j)) && 2 <= r) || (((1 <= i && (\exists v_main_~j~0_28 : int, main_~l~0 : int :: ((1 <= main_~l~0 && 2 * main_~l~0 <= v_main_~j~0_28) && 2 * v_main_~j~0_28 <= j) && r <= v_main_~j~0_28)) && 0 < l) && 2 <= r)) || (((1 <= i && (\exists v_main_~l~0_21 : int :: (1 < v_main_~l~0_21 && v_main_~l~0_21 <= l + 1) && r + 1 <= 2 * v_main_~l~0_21)) && 2 <= r) && r + 2 <= j)) && 2 * l <= n) && r <= n)) || (((((((1 <= l && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l + 3 <= n) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && 1 <= i) && 2 * l + r <= j + n) && r <= n) && 2 <= r)) || ((((((\exists v_main_~l~0_22 : int, main_~l~0 : int :: ((r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= main_~l~0 + 1) && 2 * main_~l~0 + 1 <= j) && 1 < v_main_~l~0_22) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && (\exists v_main_~l~0_22 : int :: (r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= l + 1) && 1 < v_main_~l~0_22)) && 1 <= i) && 2 * l + 2 <= n) && 2 <= r)) || ((((((((i + 1 <= n && l <= n / 2 + 1) && 2 * l <= j) && 1 <= i) && (\exists v_main_~l~0_21 : int, main_~l~0 : int :: ((1 < v_main_~l~0_21 && v_main_~l~0_21 <= main_~l~0 + 1) && r + 1 <= 2 * v_main_~l~0_21) && 2 * main_~l~0 <= j)) && l + 1 <= n) && r <= n) && j <= 2 * l) && 2 <= r)) || (((((1 <= l && 1 <= i) && l <= n / 2 + 1) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) && r + 1 <= n)) || ((((((((\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n) && 2 * l <= j) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 <= j)) && (\exists main_~l~0 : int :: 2 * main_~l~0 + 2 <= n && j <= 2 * main_~l~0)) && 1 <= i) && r <= n) && j <= 2 * l) && 2 <= r) [2018-10-27 00:42:12,230 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e7102c5-297d-4742-8917-7dab17830bfe/bin-2019/uautomizer/witness.graphml [2018-10-27 00:42:12,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:42:12,231 INFO L168 Benchmark]: Toolchain (without parser) took 231854.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 954.4 MB in the beginning and 873.0 MB in the end (delta: 81.4 MB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:12,232 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:12,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.51 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:12,232 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:12,233 INFO L168 Benchmark]: RCFGBuilder took 467.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:12,233 INFO L168 Benchmark]: TraceAbstraction took 231053.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 873.0 MB in the end (delta: 256.8 MB). Peak memory consumption was 391.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:12,234 INFO L168 Benchmark]: Witness Printer took 102.05 ms. Allocated memory is still 1.3 GB. Free memory is still 873.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:12,244 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.51 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 231053.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 873.0 MB in the end (delta: 256.8 MB). Peak memory consumption was 391.1 MB. Max. memory is 11.5 GB. * Witness Printer took 102.05 ms. Allocated memory is still 1.3 GB. Free memory is still 873.0 MB. 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[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,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_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,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_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_21,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_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,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_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,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_~l~0_22,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_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_21,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[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[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_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,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_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,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_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_21,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_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,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_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,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_~l~0_22,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_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,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_~l~0_21,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[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[main_~l~0,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-27 00:42:12,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_34,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_31,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_29,QUANTIFIED] [2018-10-27 00:42:12,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_28,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_22,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_21,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 00:42:12,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((((((1 <= l && (\exists main_~l~0 : int, v_main_~j~0_34 : int :: ((1 <= main_~l~0 && i <= v_main_~j~0_34) && 2 * v_main_~j~0_34 <= j) && 2 * main_~l~0 + 1 <= v_main_~j~0_34)) && 1 <= i) && 2 * l + r <= j + n) && r <= n) && 2 * l + 2 <= n) && 2 <= r) || (((((((\exists v_main_~l~0_22 : int, main_~l~0 : int, v_main_~j~0_31 : int :: (((r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= main_~l~0 + 1) && 2 * main_~l~0 + 1 <= v_main_~j~0_31) && 2 * v_main_~j~0_31 <= j) && 1 < v_main_~l~0_22) && 1 <= i) && 2 <= r) && (\exists v_main_~l~0_22 : int :: (r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= l + 1) && 1 < v_main_~l~0_22)) || ((((1 <= i && (\exists v_main_~l~0_21 : int :: (1 < v_main_~l~0_21 && v_main_~l~0_21 <= l + 1) && r + 1 <= 2 * v_main_~l~0_21)) && (\exists v_main_~l~0_21 : int, v_main_~j~0_29 : int, main_~l~0 : int :: (((1 < v_main_~l~0_21 && v_main_~l~0_21 <= main_~l~0 + 1) && r + 1 <= 2 * v_main_~l~0_21) && 2 * main_~l~0 <= v_main_~j~0_29) && 2 * v_main_~j~0_29 <= j)) && 2 <= r) || (((1 <= i && (\exists v_main_~j~0_28 : int, main_~l~0 : int :: ((1 <= main_~l~0 && 2 * main_~l~0 <= v_main_~j~0_28) && 2 * v_main_~j~0_28 <= j) && r <= v_main_~j~0_28)) && 0 < l) && 2 <= r)) || (((1 <= i && (\exists v_main_~l~0_21 : int :: (1 < v_main_~l~0_21 && v_main_~l~0_21 <= l + 1) && r + 1 <= 2 * v_main_~l~0_21)) && 2 <= r) && r + 2 <= j)) && 2 * l <= n) && r <= n)) || (((((((1 <= l && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l + 3 <= n) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && 1 <= i) && 2 * l + r <= j + n) && r <= n) && 2 <= r)) || ((((((\exists v_main_~l~0_22 : int, main_~l~0 : int :: ((r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= main_~l~0 + 1) && 2 * main_~l~0 + 1 <= j) && 1 < v_main_~l~0_22) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && (\exists v_main_~l~0_22 : int :: (r <= 2 * v_main_~l~0_22 && v_main_~l~0_22 <= l + 1) && 1 < v_main_~l~0_22)) && 1 <= i) && 2 * l + 2 <= n) && 2 <= r)) || ((((((((i + 1 <= n && l <= n / 2 + 1) && 2 * l <= j) && 1 <= i) && (\exists v_main_~l~0_21 : int, main_~l~0 : int :: ((1 < v_main_~l~0_21 && v_main_~l~0_21 <= main_~l~0 + 1) && r + 1 <= 2 * v_main_~l~0_21) && 2 * main_~l~0 <= j)) && l + 1 <= n) && r <= n) && j <= 2 * l) && 2 <= r)) || (((((1 <= l && 1 <= i) && l <= n / 2 + 1) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) && r + 1 <= n)) || ((((((((\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n) && 2 * l <= j) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 <= j)) && (\exists main_~l~0 : int :: 2 * main_~l~0 + 2 <= n && j <= 2 * main_~l~0)) && 1 <= i) && r <= n) && j <= 2 * l) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 230.9s OverallTime, 16 OverallIterations, 22 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 179.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 983 SDtfs, 1377 SDslu, 4338 SDs, 0 SdLazy, 6936 SolverSat, 2322 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1067 GetRequests, 797 SyntacticMatches, 8 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 604 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 804 PreInvPairs, 1213 NumberOfFragments, 4666 HoareAnnotationTreeSize, 804 FomulaSimplifications, 1571404218 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 20 FomulaSimplificationsInter, 94748407 FormulaSimplificationTreeSizeReductionInter, 176.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1639 NumberOfCodeBlocks, 1639 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1610 ConstructedInterpolants, 120 QuantifiedInterpolants, 475672 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1742 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 5030/5348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...