./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:17:36,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:17:36,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:17:36,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:17:36,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:17:36,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:17:36,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:17:36,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:17:36,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:17:36,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:17:36,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:17:36,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:17:36,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:17:36,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:17:36,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:17:36,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:17:36,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:17:36,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:17:36,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:17:36,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:17:36,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:17:36,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:17:36,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:17:36,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:17:36,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:17:36,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:17:36,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:17:36,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:17:36,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:17:36,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:17:36,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:17:36,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:17:36,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:17:36,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:17:36,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:17:36,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:17:36,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:17:36,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:17:36,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:17:36,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:17:36,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:17:36,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:17:36,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:17:36,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:17:36,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:17:36,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:17:36,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:17:36,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:17:36,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:17:36,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:17:36,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:17:36,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:17:36,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:17:36,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:17:36,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:17:36,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:17:36,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:36,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:17:36,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:17:36,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 [2019-12-07 10:17:36,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:17:37,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:17:37,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:17:37,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:17:37,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:17:37,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-12-07 10:17:37,049 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/data/d9b199b8f/90391e4eb6674f2db4346b5e2cf30bf7/FLAGa902701ce [2019-12-07 10:17:37,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:17:37,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-12-07 10:17:37,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/data/d9b199b8f/90391e4eb6674f2db4346b5e2cf30bf7/FLAGa902701ce [2019-12-07 10:17:37,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/data/d9b199b8f/90391e4eb6674f2db4346b5e2cf30bf7 [2019-12-07 10:17:37,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:17:37,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:17:37,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:37,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:17:37,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:17:37,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:37" (1/1) ... [2019-12-07 10:17:37,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf92694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:37, skipping insertion in model container [2019-12-07 10:17:37,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:17:37" (1/1) ... [2019-12-07 10:17:37,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:17:37,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:17:38,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:38,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:17:38,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:17:38,602 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:17:38,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38 WrapperNode [2019-12-07 10:17:38,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:17:38,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:38,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:17:38,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:17:38,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:17:38,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:17:38,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:17:38,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:17:38,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... [2019-12-07 10:17:38,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:17:38,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:17:38,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:17:38,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:17:38,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:17:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:17:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:17:41,582 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:17:41,582 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 10:17:41,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:41 BoogieIcfgContainer [2019-12-07 10:17:41,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:17:41,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:17:41,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:17:41,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:17:41,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:17:37" (1/3) ... [2019-12-07 10:17:41,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137ef3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:41, skipping insertion in model container [2019-12-07 10:17:41,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:17:38" (2/3) ... [2019-12-07 10:17:41,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137ef3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:17:41, skipping insertion in model container [2019-12-07 10:17:41,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:41" (3/3) ... [2019-12-07 10:17:41,589 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label01.c [2019-12-07 10:17:41,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:17:41,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:17:41,609 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:17:41,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:17:41,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:17:41,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:17:41,629 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:17:41,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:17:41,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:17:41,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:17:41,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:17:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 10:17:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:17:41,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:41,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:41,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-12-07 10:17:41,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:41,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080449029] [2019-12-07 10:17:41,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:41,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080449029] [2019-12-07 10:17:41,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:41,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:17:41,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466875152] [2019-12-07 10:17:41,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:17:41,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:17:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:41,868 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 10:17:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:45,756 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-12-07 10:17:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:17:45,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 10:17:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:45,772 INFO L225 Difference]: With dead ends: 1470 [2019-12-07 10:17:45,772 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 10:17:45,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 10:17:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-12-07 10:17:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 10:17:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-12-07 10:17:45,836 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 44 [2019-12-07 10:17:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:45,836 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-12-07 10:17:45,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:17:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-12-07 10:17:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 10:17:45,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:45,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:45,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:45,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1760666973, now seen corresponding path program 1 times [2019-12-07 10:17:45,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:45,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063516201] [2019-12-07 10:17:45,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:45,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063516201] [2019-12-07 10:17:45,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:45,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:17:45,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181128080] [2019-12-07 10:17:45,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:17:45,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:17:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:17:45,995 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 5 states. [2019-12-07 10:17:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:50,556 INFO L93 Difference]: Finished difference Result 3167 states and 4696 transitions. [2019-12-07 10:17:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:17:50,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-12-07 10:17:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:50,565 INFO L225 Difference]: With dead ends: 3167 [2019-12-07 10:17:50,566 INFO L226 Difference]: Without dead ends: 2193 [2019-12-07 10:17:50,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:17:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2019-12-07 10:17:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1886. [2019-12-07 10:17:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-12-07 10:17:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2622 transitions. [2019-12-07 10:17:50,597 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2622 transitions. Word has length 109 [2019-12-07 10:17:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:50,597 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2622 transitions. [2019-12-07 10:17:50,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:17:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2622 transitions. [2019-12-07 10:17:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 10:17:50,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:50,601 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:50,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:50,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:50,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1367533996, now seen corresponding path program 1 times [2019-12-07 10:17:50,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:50,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765403135] [2019-12-07 10:17:50,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:50,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765403135] [2019-12-07 10:17:50,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:17:50,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:17:50,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89992398] [2019-12-07 10:17:50,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:17:50,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:17:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:50,670 INFO L87 Difference]: Start difference. First operand 1886 states and 2622 transitions. Second operand 4 states. [2019-12-07 10:17:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:53,574 INFO L93 Difference]: Finished difference Result 7067 states and 9932 transitions. [2019-12-07 10:17:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:17:53,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 10:17:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:53,605 INFO L225 Difference]: With dead ends: 7067 [2019-12-07 10:17:53,605 INFO L226 Difference]: Without dead ends: 5183 [2019-12-07 10:17:53,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2019-12-07 10:17:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4878. [2019-12-07 10:17:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4878 states. [2019-12-07 10:17:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6341 transitions. [2019-12-07 10:17:53,669 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6341 transitions. Word has length 114 [2019-12-07 10:17:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:53,670 INFO L462 AbstractCegarLoop]: Abstraction has 4878 states and 6341 transitions. [2019-12-07 10:17:53,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:17:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6341 transitions. [2019-12-07 10:17:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 10:17:53,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:53,673 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:53,673 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1300079150, now seen corresponding path program 1 times [2019-12-07 10:17:53,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:53,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082194084] [2019-12-07 10:17:53,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:53,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082194084] [2019-12-07 10:17:53,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310063748] [2019-12-07 10:17:53,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:17:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:53,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:17:53,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:17:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:53,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:17:53,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-12-07 10:17:53,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317266051] [2019-12-07 10:17:53,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:17:53,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:17:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:17:53,895 INFO L87 Difference]: Start difference. First operand 4878 states and 6341 transitions. Second operand 4 states. [2019-12-07 10:17:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:57,235 INFO L93 Difference]: Finished difference Result 14287 states and 18930 transitions. [2019-12-07 10:17:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:17:57,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 10:17:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:57,267 INFO L225 Difference]: With dead ends: 14287 [2019-12-07 10:17:57,267 INFO L226 Difference]: Without dead ends: 9411 [2019-12-07 10:17:57,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:17:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-07 10:17:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 9380. [2019-12-07 10:17:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9380 states. [2019-12-07 10:17:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9380 states to 9380 states and 11899 transitions. [2019-12-07 10:17:57,382 INFO L78 Accepts]: Start accepts. Automaton has 9380 states and 11899 transitions. Word has length 135 [2019-12-07 10:17:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:57,382 INFO L462 AbstractCegarLoop]: Abstraction has 9380 states and 11899 transitions. [2019-12-07 10:17:57,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:17:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 9380 states and 11899 transitions. [2019-12-07 10:17:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 10:17:57,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:57,385 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:57,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:17:57,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:57,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2006286439, now seen corresponding path program 1 times [2019-12-07 10:17:57,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:57,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936173099] [2019-12-07 10:17:57,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 10:17:57,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936173099] [2019-12-07 10:17:57,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031226296] [2019-12-07 10:17:57,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:17:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:17:57,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:17:57,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:17:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:17:57,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:17:57,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 10:17:57,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049848124] [2019-12-07 10:17:57,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:17:57,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:17:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:17:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:57,903 INFO L87 Difference]: Start difference. First operand 9380 states and 11899 transitions. Second operand 3 states. [2019-12-07 10:17:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:17:59,394 INFO L93 Difference]: Finished difference Result 23540 states and 30243 transitions. [2019-12-07 10:17:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:17:59,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-12-07 10:17:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:17:59,437 INFO L225 Difference]: With dead ends: 23540 [2019-12-07 10:17:59,437 INFO L226 Difference]: Without dead ends: 14461 [2019-12-07 10:17:59,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:17:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-12-07 10:17:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 9376. [2019-12-07 10:17:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-12-07 10:17:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 11687 transitions. [2019-12-07 10:17:59,553 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 11687 transitions. Word has length 214 [2019-12-07 10:17:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:17:59,554 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 11687 transitions. [2019-12-07 10:17:59,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:17:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 11687 transitions. [2019-12-07 10:17:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 10:17:59,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:17:59,558 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:17:59,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:17:59,758 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:17:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:17:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash -92208819, now seen corresponding path program 1 times [2019-12-07 10:17:59,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:17:59,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146495354] [2019-12-07 10:17:59,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:17:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 10:18:00,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146495354] [2019-12-07 10:18:00,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:00,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:18:00,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443325206] [2019-12-07 10:18:00,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:18:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:18:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:00,113 INFO L87 Difference]: Start difference. First operand 9376 states and 11687 transitions. Second operand 5 states. [2019-12-07 10:18:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:02,251 INFO L93 Difference]: Finished difference Result 20547 states and 25311 transitions. [2019-12-07 10:18:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:18:02,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-12-07 10:18:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:02,266 INFO L225 Difference]: With dead ends: 20547 [2019-12-07 10:18:02,266 INFO L226 Difference]: Without dead ends: 11173 [2019-12-07 10:18:02,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11173 states. [2019-12-07 10:18:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11173 to 10871. [2019-12-07 10:18:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10871 states. [2019-12-07 10:18:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10871 states to 10871 states and 13244 transitions. [2019-12-07 10:18:02,357 INFO L78 Accepts]: Start accepts. Automaton has 10871 states and 13244 transitions. Word has length 305 [2019-12-07 10:18:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:02,358 INFO L462 AbstractCegarLoop]: Abstraction has 10871 states and 13244 transitions. [2019-12-07 10:18:02,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:18:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10871 states and 13244 transitions. [2019-12-07 10:18:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 10:18:02,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:02,364 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:02,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1024558271, now seen corresponding path program 1 times [2019-12-07 10:18:02,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:02,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140591423] [2019-12-07 10:18:02,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 10:18:02,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140591423] [2019-12-07 10:18:02,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:02,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:18:02,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596867556] [2019-12-07 10:18:02,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:02,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:02,540 INFO L87 Difference]: Start difference. First operand 10871 states and 13244 transitions. Second operand 4 states. [2019-12-07 10:18:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:04,919 INFO L93 Difference]: Finished difference Result 25031 states and 30699 transitions. [2019-12-07 10:18:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:18:04,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-12-07 10:18:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:04,934 INFO L225 Difference]: With dead ends: 25031 [2019-12-07 10:18:04,934 INFO L226 Difference]: Without dead ends: 14162 [2019-12-07 10:18:04,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2019-12-07 10:18:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 12665. [2019-12-07 10:18:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12665 states. [2019-12-07 10:18:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12665 states to 12665 states and 14798 transitions. [2019-12-07 10:18:05,052 INFO L78 Accepts]: Start accepts. Automaton has 12665 states and 14798 transitions. Word has length 390 [2019-12-07 10:18:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:05,053 INFO L462 AbstractCegarLoop]: Abstraction has 12665 states and 14798 transitions. [2019-12-07 10:18:05,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 12665 states and 14798 transitions. [2019-12-07 10:18:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-12-07 10:18:05,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:05,057 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:05,057 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -289447111, now seen corresponding path program 1 times [2019-12-07 10:18:05,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:05,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233205718] [2019-12-07 10:18:05,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:05,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233205718] [2019-12-07 10:18:05,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508251844] [2019-12-07 10:18:05,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:18:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:05,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:18:05,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:18:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:05,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:18,812 WARN L192 SmtUtils]: Spent 13.25 s on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-12-07 10:18:19,693 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_894 Int)) (let ((.cse0 (div v_~a29~0_894 5))) (and (< .cse0 0) (not (= (mod .cse0 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse0 5) 4460))))) (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) is different from true [2019-12-07 10:18:19,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 105 not checked. [2019-12-07 10:18:20,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:18:20,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 10:18:20,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877339698] [2019-12-07 10:18:20,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:18:20,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:18:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=22, Unknown=1, NotChecked=10, Total=56 [2019-12-07 10:18:20,568 INFO L87 Difference]: Start difference. First operand 12665 states and 14798 transitions. Second operand 8 states. [2019-12-07 10:18:21,956 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse3 (div v_~a29~0_894 5))) (and (< .cse3 0) (not (= (mod .cse3 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse3 5) 4460))))))) (and (or .cse0 (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) (or .cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse2 (div v_~a29~0_894 5))) (and (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse2 5) 4459)) (= (mod .cse2 5) 0))))))) is different from true [2019-12-07 10:18:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:30,085 INFO L93 Difference]: Finished difference Result 35267 states and 41876 transitions. [2019-12-07 10:18:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:18:30,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-12-07 10:18:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:30,102 INFO L225 Difference]: With dead ends: 35267 [2019-12-07 10:18:30,102 INFO L226 Difference]: Without dead ends: 22604 [2019-12-07 10:18:30,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 388 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25, Invalid=23, Unknown=2, NotChecked=22, Total=72 [2019-12-07 10:18:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22604 states. [2019-12-07 10:18:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22604 to 17751. [2019-12-07 10:18:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17751 states. [2019-12-07 10:18:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17751 states to 17751 states and 21096 transitions. [2019-12-07 10:18:30,275 INFO L78 Accepts]: Start accepts. Automaton has 17751 states and 21096 transitions. Word has length 391 [2019-12-07 10:18:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:30,276 INFO L462 AbstractCegarLoop]: Abstraction has 17751 states and 21096 transitions. [2019-12-07 10:18:30,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:18:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17751 states and 21096 transitions. [2019-12-07 10:18:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-12-07 10:18:30,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:30,281 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:30,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:18:30,483 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1505436081, now seen corresponding path program 1 times [2019-12-07 10:18:30,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:30,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529132724] [2019-12-07 10:18:30,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:30,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529132724] [2019-12-07 10:18:30,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:18:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978029307] [2019-12-07 10:18:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:30,775 INFO L87 Difference]: Start difference. First operand 17751 states and 21096 transitions. Second operand 4 states. [2019-12-07 10:18:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:34,753 INFO L93 Difference]: Finished difference Result 38793 states and 46339 transitions. [2019-12-07 10:18:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:18:34,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2019-12-07 10:18:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:34,771 INFO L225 Difference]: With dead ends: 38793 [2019-12-07 10:18:34,772 INFO L226 Difference]: Without dead ends: 21044 [2019-12-07 10:18:34,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21044 states. [2019-12-07 10:18:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21044 to 19842. [2019-12-07 10:18:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19842 states. [2019-12-07 10:18:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19842 states to 19842 states and 23112 transitions. [2019-12-07 10:18:34,949 INFO L78 Accepts]: Start accepts. Automaton has 19842 states and 23112 transitions. Word has length 445 [2019-12-07 10:18:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:34,949 INFO L462 AbstractCegarLoop]: Abstraction has 19842 states and 23112 transitions. [2019-12-07 10:18:34,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19842 states and 23112 transitions. [2019-12-07 10:18:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-12-07 10:18:34,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:34,953 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:34,954 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash -377920542, now seen corresponding path program 1 times [2019-12-07 10:18:34,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:34,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319885314] [2019-12-07 10:18:34,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 299 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 10:18:35,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319885314] [2019-12-07 10:18:35,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675173097] [2019-12-07 10:18:35,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:18:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:35,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:18:35,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:18:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:18:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 263 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 10:18:36,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:18:36,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 10:18:36,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904575224] [2019-12-07 10:18:36,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:18:36,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:36,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:18:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:18:36,119 INFO L87 Difference]: Start difference. First operand 19842 states and 23112 transitions. Second operand 9 states. [2019-12-07 10:18:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:43,895 INFO L93 Difference]: Finished difference Result 47064 states and 54313 transitions. [2019-12-07 10:18:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:18:43,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 447 [2019-12-07 10:18:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:43,916 INFO L225 Difference]: With dead ends: 47064 [2019-12-07 10:18:43,916 INFO L226 Difference]: Without dead ends: 19840 [2019-12-07 10:18:43,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:18:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19840 states. [2019-12-07 10:18:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19840 to 17446. [2019-12-07 10:18:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-12-07 10:18:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 18768 transitions. [2019-12-07 10:18:44,083 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 18768 transitions. Word has length 447 [2019-12-07 10:18:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:44,083 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 18768 transitions. [2019-12-07 10:18:44,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:18:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 18768 transitions. [2019-12-07 10:18:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-12-07 10:18:44,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:44,086 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:44,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:18:44,288 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash 319650045, now seen corresponding path program 1 times [2019-12-07 10:18:44,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:44,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846926688] [2019-12-07 10:18:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 42 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:44,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846926688] [2019-12-07 10:18:44,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162710190] [2019-12-07 10:18:44,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:18:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:44,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:18:44,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:18:44,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:44,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:18:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 236 proven. 106 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 10:18:45,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:18:45,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-12-07 10:18:45,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270637357] [2019-12-07 10:18:45,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:18:45,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:18:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:18:45,526 INFO L87 Difference]: Start difference. First operand 17446 states and 18768 transitions. Second operand 8 states. [2019-12-07 10:19:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:48,479 INFO L93 Difference]: Finished difference Result 48722 states and 52264 transitions. [2019-12-07 10:19:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:19:48,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 498 [2019-12-07 10:19:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:48,500 INFO L225 Difference]: With dead ends: 48722 [2019-12-07 10:19:48,500 INFO L226 Difference]: Without dead ends: 30979 [2019-12-07 10:19:48,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:19:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30979 states. [2019-12-07 10:19:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30979 to 24332. [2019-12-07 10:19:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24332 states. [2019-12-07 10:19:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24332 states to 24332 states and 26160 transitions. [2019-12-07 10:19:48,727 INFO L78 Accepts]: Start accepts. Automaton has 24332 states and 26160 transitions. Word has length 498 [2019-12-07 10:19:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:48,728 INFO L462 AbstractCegarLoop]: Abstraction has 24332 states and 26160 transitions. [2019-12-07 10:19:48,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:19:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 24332 states and 26160 transitions. [2019-12-07 10:19:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-12-07 10:19:48,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:48,731 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:48,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:19:48,933 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1407121983, now seen corresponding path program 1 times [2019-12-07 10:19:48,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:19:48,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110000416] [2019-12-07 10:19:48,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 87 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:19:49,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110000416] [2019-12-07 10:19:49,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730878558] [2019-12-07 10:19:49,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:19:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:49,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:19:49,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:19:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:50,684 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2019-12-07 10:19:50,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:50,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:50,899 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-12-07 10:19:50,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:50,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:19:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 125 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:19:51,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:19:51,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-12-07 10:19:51,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305900094] [2019-12-07 10:19:51,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:19:51,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:19:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:19:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:19:51,724 INFO L87 Difference]: Start difference. First operand 24332 states and 26160 transitions. Second operand 9 states. [2019-12-07 10:21:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:13,487 INFO L93 Difference]: Finished difference Result 61611 states and 66223 transitions. [2019-12-07 10:21:13,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:21:13,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 510 [2019-12-07 10:21:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:13,514 INFO L225 Difference]: With dead ends: 61611 [2019-12-07 10:21:13,514 INFO L226 Difference]: Without dead ends: 36982 [2019-12-07 10:21:13,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:21:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36982 states. [2019-12-07 10:21:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36982 to 27032. [2019-12-07 10:21:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27032 states. [2019-12-07 10:21:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27032 states to 27032 states and 29108 transitions. [2019-12-07 10:21:13,778 INFO L78 Accepts]: Start accepts. Automaton has 27032 states and 29108 transitions. Word has length 510 [2019-12-07 10:21:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:13,779 INFO L462 AbstractCegarLoop]: Abstraction has 27032 states and 29108 transitions. [2019-12-07 10:21:13,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:21:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27032 states and 29108 transitions. [2019-12-07 10:21:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-12-07 10:21:13,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:13,783 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:13,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:13,985 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1741362260, now seen corresponding path program 1 times [2019-12-07 10:21:13,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:13,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063435429] [2019-12-07 10:21:13,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 390 proven. 132 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 10:21:14,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063435429] [2019-12-07 10:21:14,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498478365] [2019-12-07 10:21:14,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:14,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:21:14,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 10:21:14,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:21:14,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 10:21:14,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982792011] [2019-12-07 10:21:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:21:14,863 INFO L87 Difference]: Start difference. First operand 27032 states and 29108 transitions. Second operand 3 states. [2019-12-07 10:21:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:15,775 INFO L93 Difference]: Finished difference Result 53762 states and 57912 transitions. [2019-12-07 10:21:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:15,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2019-12-07 10:21:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:15,795 INFO L225 Difference]: With dead ends: 53762 [2019-12-07 10:21:15,795 INFO L226 Difference]: Without dead ends: 27031 [2019-12-07 10:21:15,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:21:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-07 10:21:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 26431. [2019-12-07 10:21:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26431 states. [2019-12-07 10:21:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26431 states to 26431 states and 28281 transitions. [2019-12-07 10:21:16,017 INFO L78 Accepts]: Start accepts. Automaton has 26431 states and 28281 transitions. Word has length 567 [2019-12-07 10:21:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:16,018 INFO L462 AbstractCegarLoop]: Abstraction has 26431 states and 28281 transitions. [2019-12-07 10:21:16,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 26431 states and 28281 transitions. [2019-12-07 10:21:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-12-07 10:21:16,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:16,024 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:16,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:16,226 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 588763416, now seen corresponding path program 1 times [2019-12-07 10:21:16,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:16,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565743157] [2019-12-07 10:21:16,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 190 proven. 131 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-12-07 10:21:17,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565743157] [2019-12-07 10:21:17,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877376775] [2019-12-07 10:21:17,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:21:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:17,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:21:17,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:21:17,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:21:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:17,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:21:28,398 WARN L192 SmtUtils]: Spent 11.02 s on a formula simplification. DAG size of input: 191 DAG size of output: 30 [2019-12-07 10:21:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 212 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-12-07 10:21:28,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:21:28,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-12-07 10:21:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855329578] [2019-12-07 10:21:28,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:21:28,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:21:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:21:28,795 INFO L87 Difference]: Start difference. First operand 26431 states and 28281 transitions. Second operand 11 states. [2019-12-07 10:22:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:03,272 INFO L93 Difference]: Finished difference Result 58536 states and 62542 transitions. [2019-12-07 10:22:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:22:03,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 626 [2019-12-07 10:22:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:03,295 INFO L225 Difference]: With dead ends: 58536 [2019-12-07 10:22:03,295 INFO L226 Difference]: Without dead ends: 32104 [2019-12-07 10:22:03,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 634 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:22:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32104 states. [2019-12-07 10:22:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32104 to 23432. [2019-12-07 10:22:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23432 states. [2019-12-07 10:22:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23432 states to 23432 states and 24642 transitions. [2019-12-07 10:22:03,537 INFO L78 Accepts]: Start accepts. Automaton has 23432 states and 24642 transitions. Word has length 626 [2019-12-07 10:22:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 23432 states and 24642 transitions. [2019-12-07 10:22:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:22:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23432 states and 24642 transitions. [2019-12-07 10:22:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-12-07 10:22:03,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:03,543 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:03,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:22:03,744 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash -197045537, now seen corresponding path program 1 times [2019-12-07 10:22:03,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:03,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553408029] [2019-12-07 10:22:03,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-12-07 10:22:04,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553408029] [2019-12-07 10:22:04,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:04,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:22:04,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567166493] [2019-12-07 10:22:04,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:22:04,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:22:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:22:04,099 INFO L87 Difference]: Start difference. First operand 23432 states and 24642 transitions. Second operand 5 states. [2019-12-07 10:22:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:07,190 INFO L93 Difference]: Finished difference Result 55874 states and 58696 transitions. [2019-12-07 10:22:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:22:07,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 630 [2019-12-07 10:22:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:07,215 INFO L225 Difference]: With dead ends: 55874 [2019-12-07 10:22:07,215 INFO L226 Difference]: Without dead ends: 32145 [2019-12-07 10:22:07,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:22:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32145 states. [2019-12-07 10:22:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32145 to 23733. [2019-12-07 10:22:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23733 states. [2019-12-07 10:22:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23733 states to 23733 states and 24982 transitions. [2019-12-07 10:22:07,447 INFO L78 Accepts]: Start accepts. Automaton has 23733 states and 24982 transitions. Word has length 630 [2019-12-07 10:22:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:07,448 INFO L462 AbstractCegarLoop]: Abstraction has 23733 states and 24982 transitions. [2019-12-07 10:22:07,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:22:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23733 states and 24982 transitions. [2019-12-07 10:22:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-12-07 10:22:07,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:07,453 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:07,453 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -623330870, now seen corresponding path program 1 times [2019-12-07 10:22:07,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:07,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025574630] [2019-12-07 10:22:07,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-12-07 10:22:07,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025574630] [2019-12-07 10:22:07,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:07,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:22:07,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385912588] [2019-12-07 10:22:07,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:22:07,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:22:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:07,733 INFO L87 Difference]: Start difference. First operand 23733 states and 24982 transitions. Second operand 3 states. [2019-12-07 10:22:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:08,834 INFO L93 Difference]: Finished difference Result 51065 states and 53778 transitions. [2019-12-07 10:22:08,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:22:08,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2019-12-07 10:22:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:08,855 INFO L225 Difference]: With dead ends: 51065 [2019-12-07 10:22:08,855 INFO L226 Difference]: Without dead ends: 27035 [2019-12-07 10:22:08,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27035 states. [2019-12-07 10:22:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27035 to 27025. [2019-12-07 10:22:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27025 states. [2019-12-07 10:22:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27025 states to 27025 states and 28227 transitions. [2019-12-07 10:22:09,094 INFO L78 Accepts]: Start accepts. Automaton has 27025 states and 28227 transitions. Word has length 632 [2019-12-07 10:22:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:09,094 INFO L462 AbstractCegarLoop]: Abstraction has 27025 states and 28227 transitions. [2019-12-07 10:22:09,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:22:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27025 states and 28227 transitions. [2019-12-07 10:22:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-12-07 10:22:09,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:09,103 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:09,103 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1435228887, now seen corresponding path program 1 times [2019-12-07 10:22:09,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:09,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69193151] [2019-12-07 10:22:09,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-12-07 10:22:09,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69193151] [2019-12-07 10:22:09,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:09,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:22:09,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560133640] [2019-12-07 10:22:09,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:22:09,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:22:09,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:09,432 INFO L87 Difference]: Start difference. First operand 27025 states and 28227 transitions. Second operand 3 states. [2019-12-07 10:22:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:10,402 INFO L93 Difference]: Finished difference Result 56140 states and 58626 transitions. [2019-12-07 10:22:10,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:22:10,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 684 [2019-12-07 10:22:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:10,424 INFO L225 Difference]: With dead ends: 56140 [2019-12-07 10:22:10,424 INFO L226 Difference]: Without dead ends: 29117 [2019-12-07 10:22:10,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29117 states. [2019-12-07 10:22:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29117 to 26725. [2019-12-07 10:22:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26725 states. [2019-12-07 10:22:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26725 states to 26725 states and 27904 transitions. [2019-12-07 10:22:10,668 INFO L78 Accepts]: Start accepts. Automaton has 26725 states and 27904 transitions. Word has length 684 [2019-12-07 10:22:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:10,668 INFO L462 AbstractCegarLoop]: Abstraction has 26725 states and 27904 transitions. [2019-12-07 10:22:10,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:22:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26725 states and 27904 transitions. [2019-12-07 10:22:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-12-07 10:22:10,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:10,679 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:10,679 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash -749809954, now seen corresponding path program 1 times [2019-12-07 10:22:10,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:10,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312821860] [2019-12-07 10:22:10,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 334 proven. 412 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 10:22:11,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312821860] [2019-12-07 10:22:11,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766997189] [2019-12-07 10:22:11,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:22:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:11,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:22:11,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:22:11,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:22:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:11,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:11,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:22:18,161 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:22:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 557 proven. 119 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 10:22:21,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:22:21,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-12-07 10:22:21,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143590750] [2019-12-07 10:22:21,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:22:21,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:22:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=203, Unknown=1, NotChecked=0, Total=272 [2019-12-07 10:22:21,417 INFO L87 Difference]: Start difference. First operand 26725 states and 27904 transitions. Second operand 17 states. [2019-12-07 10:23:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:22,574 INFO L93 Difference]: Finished difference Result 66939 states and 69750 transitions. [2019-12-07 10:23:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 10:23:22,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 732 [2019-12-07 10:23:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:22,601 INFO L225 Difference]: With dead ends: 66939 [2019-12-07 10:23:22,601 INFO L226 Difference]: Without dead ends: 39612 [2019-12-07 10:23:22,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 764 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=854, Invalid=2927, Unknown=1, NotChecked=0, Total=3782 [2019-12-07 10:23:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39612 states. [2019-12-07 10:23:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39612 to 22827. [2019-12-07 10:23:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2019-12-07 10:23:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 23816 transitions. [2019-12-07 10:23:22,864 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 23816 transitions. Word has length 732 [2019-12-07 10:23:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:22,864 INFO L462 AbstractCegarLoop]: Abstraction has 22827 states and 23816 transitions. [2019-12-07 10:23:22,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:23:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 23816 transitions. [2019-12-07 10:23:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-12-07 10:23:22,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:22,875 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:23:23,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:23:23,077 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:23,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 578201737, now seen corresponding path program 1 times [2019-12-07 10:23:23,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:23,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271830040] [2019-12-07 10:23:23,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-12-07 10:23:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271830040] [2019-12-07 10:23:23,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:23,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:23:23,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710907817] [2019-12-07 10:23:23,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:23:23,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:23:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:23:23,497 INFO L87 Difference]: Start difference. First operand 22827 states and 23816 transitions. Second operand 3 states. [2019-12-07 10:23:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:24,629 INFO L93 Difference]: Finished difference Result 45949 states and 47941 transitions. [2019-12-07 10:23:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:23:24,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2019-12-07 10:23:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:24,644 INFO L225 Difference]: With dead ends: 45949 [2019-12-07 10:23:24,644 INFO L226 Difference]: Without dead ends: 23124 [2019-12-07 10:23:24,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:23:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23124 states. [2019-12-07 10:23:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23124 to 22825. [2019-12-07 10:23:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22825 states. [2019-12-07 10:23:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22825 states to 22825 states and 23812 transitions. [2019-12-07 10:23:24,842 INFO L78 Accepts]: Start accepts. Automaton has 22825 states and 23812 transitions. Word has length 758 [2019-12-07 10:23:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:24,843 INFO L462 AbstractCegarLoop]: Abstraction has 22825 states and 23812 transitions. [2019-12-07 10:23:24,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:23:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22825 states and 23812 transitions. [2019-12-07 10:23:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2019-12-07 10:23:24,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:24,881 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:23:24,881 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1706100167, now seen corresponding path program 1 times [2019-12-07 10:23:24,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849570554] [2019-12-07 10:23:24,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 757 proven. 163 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 10:23:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849570554] [2019-12-07 10:23:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837061714] [2019-12-07 10:23:25,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:23:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:25,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:23:25,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:23:25,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:23:25,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:23:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 10:23:26,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:23:26,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-12-07 10:23:26,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864286924] [2019-12-07 10:23:26,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:23:26,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:26,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:23:26,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:23:26,316 INFO L87 Difference]: Start difference. First operand 22825 states and 23812 transitions. Second operand 3 states. [2019-12-07 10:23:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:27,636 INFO L93 Difference]: Finished difference Result 49847 states and 52054 transitions. [2019-12-07 10:23:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:23:27,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 804 [2019-12-07 10:23:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:27,661 INFO L225 Difference]: With dead ends: 49847 [2019-12-07 10:23:27,661 INFO L226 Difference]: Without dead ends: 27024 [2019-12-07 10:23:27,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:23:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27024 states. [2019-12-07 10:23:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27024 to 24324. [2019-12-07 10:23:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24324 states. [2019-12-07 10:23:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24324 states to 24324 states and 25219 transitions. [2019-12-07 10:23:27,895 INFO L78 Accepts]: Start accepts. Automaton has 24324 states and 25219 transitions. Word has length 804 [2019-12-07 10:23:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:27,896 INFO L462 AbstractCegarLoop]: Abstraction has 24324 states and 25219 transitions. [2019-12-07 10:23:27,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:23:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24324 states and 25219 transitions. [2019-12-07 10:23:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-12-07 10:23:27,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:27,911 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:23:28,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:23:28,113 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:28,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1858402503, now seen corresponding path program 1 times [2019-12-07 10:23:28,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:28,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041619755] [2019-12-07 10:23:28,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-12-07 10:23:28,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041619755] [2019-12-07 10:23:28,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:28,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:23:28,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044905324] [2019-12-07 10:23:28,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:23:28,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:23:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:23:28,604 INFO L87 Difference]: Start difference. First operand 24324 states and 25219 transitions. Second operand 3 states. [2019-12-07 10:23:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:29,777 INFO L93 Difference]: Finished difference Result 41111 states and 42625 transitions. [2019-12-07 10:23:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:23:29,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 840 [2019-12-07 10:23:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:29,793 INFO L225 Difference]: With dead ends: 41111 [2019-12-07 10:23:29,793 INFO L226 Difference]: Without dead ends: 16789 [2019-12-07 10:23:29,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:23:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16789 states. [2019-12-07 10:23:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16789 to 14696. [2019-12-07 10:23:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14696 states. [2019-12-07 10:23:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14696 states to 14696 states and 15050 transitions. [2019-12-07 10:23:29,966 INFO L78 Accepts]: Start accepts. Automaton has 14696 states and 15050 transitions. Word has length 840 [2019-12-07 10:23:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:29,967 INFO L462 AbstractCegarLoop]: Abstraction has 14696 states and 15050 transitions. [2019-12-07 10:23:29,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:23:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 14696 states and 15050 transitions. [2019-12-07 10:23:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-12-07 10:23:29,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:29,982 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:23:29,982 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 798112884, now seen corresponding path program 1 times [2019-12-07 10:23:29,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:29,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796625031] [2019-12-07 10:23:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-12-07 10:23:30,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796625031] [2019-12-07 10:23:30,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:30,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:23:30,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889465273] [2019-12-07 10:23:30,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:23:30,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:23:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:30,670 INFO L87 Difference]: Start difference. First operand 14696 states and 15050 transitions. Second operand 5 states. [2019-12-07 10:23:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:32,309 INFO L93 Difference]: Finished difference Result 17099 states and 17500 transitions. [2019-12-07 10:23:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:23:32,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 966 [2019-12-07 10:23:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:32,310 INFO L225 Difference]: With dead ends: 17099 [2019-12-07 10:23:32,310 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:23:32,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:23:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:23:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:23:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:23:32,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 966 [2019-12-07 10:23:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:32,315 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:23:32,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:23:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:23:32,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:23:32,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:23:33,495 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 1070 DAG size of output: 825 [2019-12-07 10:23:34,596 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 1056 DAG size of output: 786 [2019-12-07 10:23:35,286 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 795 DAG size of output: 643 [2019-12-07 10:24:21,830 WARN L192 SmtUtils]: Spent 46.54 s on a formula simplification. DAG size of input: 773 DAG size of output: 160 [2019-12-07 10:24:58,643 WARN L192 SmtUtils]: Spent 36.81 s on a formula simplification. DAG size of input: 728 DAG size of output: 155 [2019-12-07 10:25:18,158 WARN L192 SmtUtils]: Spent 19.51 s on a formula simplification. DAG size of input: 605 DAG size of output: 157 [2019-12-07 10:25:18,161 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,161 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,161 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,161 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,161 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,162 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,163 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 10:25:18,164 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 10:25:18,165 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,166 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,167 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,168 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 10:25:18,169 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,170 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,171 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,172 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse18 (= 3 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse11 (+ ~a4~0 86))) (let ((.cse15 (+ ~a29~0 127)) (.cse14 (<= .cse11 0)) (.cse19 (<= 0 (+ ~a0~0 44))) (.cse20 (not .cse2)) (.cse9 (not .cse18)) (.cse26 (+ ~a0~0 147))) (let ((.cse23 (<= ~a29~0 599997)) (.cse8 (<= ~a29~0 599999)) (.cse5 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse26 0))) (.cse21 (= 2 ~a2~0)) (.cse7 (< 43 ~a29~0)) (.cse12 (<= ~a29~0 43)) (.cse6 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse17 (<= (+ ~a0~0 61) 0)) (.cse3 (< 0 .cse26)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse4 (<= (+ ~a29~0 16) 0)) (.cse16 (< 0 (+ ~a29~0 144))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse22 (or (and .cse14 .cse20 .cse9) (and .cse19 .cse20 .cse9))) (.cse13 (<= 0 .cse15)) (.cse10 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse9 .cse10 (<= ~a2~0 4)) (and .cse1 (< 0 .cse11) .cse2 .cse12 .cse13) (and .cse14 (<= .cse15 0) (= 4 ~a2~0)) (and .cse1 .cse2 .cse4 .cse16 .cse17) (and .cse14 .cse6 .cse18) (and .cse14 .cse2 .cse19 .cse4 .cse13) (and .cse14 .cse20 .cse17) (and .cse1 .cse6 .cse21 .cse22) (and .cse0 .cse1 .cse5 .cse6 .cse18) (and (<= (+ ~a0~0 366640) 0) .cse1 .cse10 .cse23) (and (or (and .cse5 .cse6 .cse21 .cse7) (and .cse21 .cse7 .cse23)) .cse0) (and .cse0 .cse1 .cse8 .cse5 .cse21) (and .cse0 .cse1 .cse6 .cse21) (and .cse14 .cse2 .cse17 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse7 .cse10) (and .cse1 (let ((.cse24 (or (and .cse2 .cse3 .cse12 .cse16 .cse17) (and (<= (+ ~a29~0 80425) 0) .cse2 .cse3 .cse17)))) (or (and .cse24 .cse16) (and .cse24 (exists ((v_prenex_4 Int)) (let ((.cse25 (div v_prenex_4 5))) (and (= (mod (+ .cse25 1) 5) 0) (< v_prenex_4 0) (< .cse25 403018) (not (= 0 (mod v_prenex_4 5))) (<= ~a29~0 (+ (div (+ .cse25 (- 403018)) 5) 1)) (not (= (mod (+ .cse25 2) 5) 0)) (<= (+ v_prenex_4 144) 0)))))))) (and .cse0 .cse1 .cse6 .cse13 .cse9 .cse10) (and .cse14 .cse2 .cse4 .cse17) (and .cse0 .cse1 .cse3 (<= (+ ~a29~0 56603) 0) .cse10) (and .cse14 (<= (+ ~a29~0 145526) 0) .cse20 (<= ~a2~0 3)) (and .cse0 .cse1 .cse4 .cse16 .cse10) (and .cse1 (<= ~a29~0 96178) .cse22 .cse13 .cse10))))) [2019-12-07 10:25:18,172 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,173 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,174 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse26 (+ ~a4~0 86)) (.cse28 (+ ~a0~0 147)) (.cse20 (= 3 ~a2~0)) (.cse10 (= 1 ~a2~0))) (let ((.cse17 (+ ~a29~0 127)) (.cse18 (not .cse10)) (.cse14 (not .cse20)) (.cse23 (+ ~a29~0 144)) (.cse24 (< 0 .cse28)) (.cse3 (<= 0 (+ ~a0~0 44))) (.cse0 (<= .cse26 0)) (.cse4 (<= (+ ~a29~0 16) 0))) (let ((.cse13 (<= ~a29~0 599999)) (.cse9 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse28 0))) (.cse16 (<= ~a2~0 4)) (.cse21 (= 2 ~a2~0)) (.cse1 (or (and .cse0 .cse10 .cse24) (and .cse10 .cse3) (and .cse0 .cse10 .cse4))) (.cse2 (<= ~a29~0 43)) (.cse5 (< 0 .cse23)) (.cse22 (<= ~a29~0 599997)) (.cse11 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse7 (<= (+ ~a0~0 98) 0)) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse12 (< 43 ~a29~0)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse27 (or (and .cse0 .cse18 .cse14) (and .cse3 .cse18 .cse14))) (.cse6 (<= 0 .cse17)) (.cse15 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse8 .cse13 .cse14 .cse15 .cse16) (and .cse0 (<= .cse17 0) (= 4 ~a2~0)) (and .cse0 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse11 .cse20) (and (or (and .cse9 .cse11 .cse21 .cse12) (and .cse21 .cse12 .cse22)) .cse7) (and .cse7 .cse8 .cse13 .cse9 .cse21) (and .cse7 .cse8 .cse11 .cse21) (and .cse0 (<= (+ ~a29~0 145526) 0) .cse16) (and .cse0 .cse10 (<= .cse23 0)) (and .cse7 .cse8 .cse4 .cse5 .cse15) (and .cse7 .cse8 .cse24 .cse14 .cse15 .cse12) (and .cse7 .cse8 .cse10 .cse24 .cse4) (and .cse8 .cse10 .cse24 .cse19 (exists ((v_prenex_4 Int)) (let ((.cse25 (div v_prenex_4 5))) (and (= (mod (+ .cse25 1) 5) 0) (< v_prenex_4 0) (< .cse25 403018) (not (= 0 (mod v_prenex_4 5))) (<= ~a29~0 (+ (div (+ .cse25 (- 403018)) 5) 1)) (not (= (mod (+ .cse25 2) 5) 0)) (<= (+ v_prenex_4 144) 0))))) (and .cse8 (< 0 .cse26) .cse10 .cse2 .cse6) (and .cse8 .cse10 .cse4 .cse5 .cse19) (and .cse0 .cse11 .cse20) (and .cse8 .cse11 .cse21 .cse27) (and .cse1 .cse2 .cse5 .cse19) (and (<= (+ ~a0~0 366640) 0) .cse8 .cse15 .cse22) (and .cse7 .cse8 .cse11 .cse6 .cse14 .cse15) (and .cse7 .cse8 .cse24 (<= (+ ~a29~0 56603) 0) .cse15) (and .cse0 .cse19 .cse12) (and .cse8 (<= ~a29~0 96178) .cse27 .cse6 .cse15))))) [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,175 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,176 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 10:25:18,177 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse27 (+ ~a0~0 147)) (.cse24 (+ ~a4~0 86)) (.cse14 (= 3 ~a2~0)) (.cse3 (= 1 ~a2~0))) (let ((.cse11 (+ ~a29~0 127)) (.cse12 (not .cse3)) (.cse7 (not .cse14)) (.cse10 (<= .cse24 0)) (.cse20 (< 0 .cse27)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse17 (+ ~a29~0 144))) (let ((.cse6 (<= ~a29~0 599999)) (.cse2 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse27 0))) (.cse9 (<= ~a2~0 4)) (.cse18 (<= (+ ~a29~0 16) 0)) (.cse19 (< 0 .cse17)) (.cse15 (= 2 ~a2~0)) (.cse21 (or (and .cse10 .cse3 .cse20) (and .cse3 .cse22))) (.cse16 (<= ~a29~0 599997)) (.cse4 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse13 (<= (+ ~a0~0 61) 0)) (.cse5 (< 43 ~a29~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse26 (or (and .cse10 .cse12 .cse7) (and .cse22 .cse12 .cse7))) (.cse23 (<= 0 .cse11)) (.cse8 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9) (and .cse10 (<= .cse11 0) (= 4 ~a2~0)) (and .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse14) (and (or (and .cse2 .cse4 .cse15 .cse5) (and .cse15 .cse5 .cse16)) .cse0) (and .cse0 .cse1 .cse6 .cse2 .cse15) (and .cse0 .cse1 .cse4 .cse15) (and .cse10 (<= (+ ~a29~0 145526) 0) .cse9) (and .cse10 .cse3 (<= .cse17 0)) (and .cse0 .cse1 .cse18 .cse19 .cse8) (and .cse0 .cse1 .cse20 .cse7 .cse8 .cse5) (and .cse10 .cse21 .cse22 .cse18 .cse23) (and .cse0 .cse1 .cse3 .cse20 .cse18) (and .cse1 (< 0 .cse24) .cse3 (<= ~a29~0 43) .cse23) (and .cse1 .cse3 .cse20 .cse13 (exists ((v_prenex_4 Int)) (let ((.cse25 (div v_prenex_4 5))) (and (= (mod (+ .cse25 1) 5) 0) (< v_prenex_4 0) (< .cse25 403018) (not (= 0 (mod v_prenex_4 5))) (<= ~a29~0 (+ (div (+ .cse25 (- 403018)) 5) 1)) (not (= (mod (+ .cse25 2) 5) 0)) (<= (+ v_prenex_4 144) 0))))) (and .cse1 .cse3 .cse18 .cse19 .cse13) (and .cse10 .cse4 .cse14) (and .cse1 .cse4 .cse15 .cse26) (and .cse21 .cse13) (and (<= (+ ~a0~0 366640) 0) .cse1 .cse8 .cse16) (and .cse0 .cse1 .cse4 .cse23 .cse7 .cse8) (and .cse0 .cse1 .cse20 (<= (+ ~a29~0 56603) 0) .cse8) (and .cse10 .cse13 .cse5) (and .cse1 (<= ~a29~0 96178) .cse26 .cse23 .cse8))))) [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,178 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,179 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:25:18,180 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,181 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 10:25:18,182 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 10:25:18,183 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 10:25:18,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:25:18 BoogieIcfgContainer [2019-12-07 10:25:18,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:25:18,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:25:18,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:25:18,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:25:18,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:17:41" (3/4) ... [2019-12-07 10:25:18,237 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:25:18,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 10:25:18,265 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:25:18,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0))) && a29 <= 43) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 < a29 + 144) && 0 <= a29 + 127) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || (((((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0)) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) [2019-12-07 10:25:18,288 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 86 <= 0 && (((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || ((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) [2019-12-07 10:25:18,297 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((a4 + 86 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && a0 + 61 <= 0) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((((((1 == a2 && 0 < a0 + 147) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) || (((a29 + 80425 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) && 0 < a29 + 144) || ((((((1 == a2 && 0 < a0 + 147) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) || (((a29 + 80425 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))))) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || (((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) [2019-12-07 10:25:18,400 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a84a51d8-c788-444f-9eef-7c65a684bcf6/bin/uautomizer/witness.graphml [2019-12-07 10:25:18,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:25:18,401 INFO L168 Benchmark]: Toolchain (without parser) took 460562.23 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 934.0 MB in the beginning and 1.5 GB in the end (delta: -610.4 MB). Peak memory consumption was 475.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,401 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:25:18,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -75.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 971.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,401 INFO L168 Benchmark]: Boogie Preprocessor took 132.03 ms. Allocated memory is still 1.1 GB. Free memory was 971.8 MB in the beginning and 944.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,402 INFO L168 Benchmark]: RCFGBuilder took 2736.51 ms. Allocated memory is still 1.1 GB. Free memory was 944.4 MB in the beginning and 876.5 MB in the end (delta: 67.9 MB). Peak memory consumption was 154.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,402 INFO L168 Benchmark]: TraceAbstraction took 456649.67 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 993.5 MB). Free memory was 876.5 MB in the beginning and 1.6 GB in the end (delta: -725.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,402 INFO L168 Benchmark]: Witness Printer took 165.86 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:25:18,403 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 759.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -75.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 971.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.03 ms. Allocated memory is still 1.1 GB. Free memory was 971.8 MB in the beginning and 944.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2736.51 ms. Allocated memory is still 1.1 GB. Free memory was 944.4 MB in the beginning and 876.5 MB in the end (delta: 67.9 MB). Peak memory consumption was 154.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 456649.67 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 993.5 MB). Free memory was 876.5 MB in the beginning and 1.6 GB in the end (delta: -725.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 165.86 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 1766]: Loop Invariant [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0))) && a29 <= 43) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 < a29 + 144) && 0 <= a29 + 127) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || (((((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0)) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 10:25:18,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 86 <= 0 && (((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || ((((a4 + 86 <= 0 && 1 == a2) && 0 < a0 + 147) || (1 == a2 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 10:25:18,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 10:25:18,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 1 == a2) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((((a4 + 86 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 16 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2))))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && 2 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && a0 + 61 <= 0) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((((((1 == a2 && 0 < a0 + 147) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) || (((a29 + 80425 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) && 0 < a29 + 144) || ((((((1 == a2 && 0 < a0 + 147) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) || (((a29 + 80425 <= 0 && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) && (\exists v_prenex_4 : int :: ((((((v_prenex_4 / 5 + 1) % 5 == 0 && v_prenex_4 < 0) && v_prenex_4 / 5 < 403018) && !(0 == v_prenex_4 % 5)) && a29 <= (v_prenex_4 / 5 + -403018) / 5 + 1) && !((v_prenex_4 / 5 + 2) % 5 == 0)) && v_prenex_4 + 144 <= 0))))) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && !(3 == a2)) && 3 <= a2)) || (((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && a29 + 56603 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || ((((a4 + 42 <= 0 && a29 <= 96178) && (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) || ((0 <= a0 + 44 && !(1 == a2)) && !(3 == a2)))) && 0 <= a29 + 127) && 3 <= a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 350.6s, OverallIterations: 22, TraceHistogramMax: 6, AutomataDifference: 294.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 105.8s, HoareTripleCheckerStatistics: 4683 SDtfs, 29282 SDslu, 2120 SDs, 0 SdLazy, 64954 SolverSat, 8187 SolverUnsat, 100 SolverUnknown, 0 SolverNotchecked, 273.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5169 GetRequests, 4976 SyntacticMatches, 41 SemanticMatches, 152 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27032occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 74538 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 294 NumberOfFragments, 2368 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2353185 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 571959 FormulaSimplificationTreeSizeReductionInter, 102.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 42.9s InterpolantComputationTime, 15765 NumberOfCodeBlocks, 15765 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 15733 ConstructedInterpolants, 517 QuantifiedInterpolants, 37619117 SizeOfPredicates, 9 NumberOfNonLiveVariables, 5946 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 12657/14950 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...