./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/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 5c4bbd5742ee42b28c0926d836f34d49923e4f62 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:47:25,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:47:25,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:47:26,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:47:26,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:47:26,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:47:26,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:47:26,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:47:26,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:47:26,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:47:26,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:47:26,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:47:26,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:47:26,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:47:26,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:47:26,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:47:26,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:47:26,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:47:26,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:47:26,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:47:26,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:47:26,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:47:26,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:47:26,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:47:26,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:47:26,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:47:26,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:47:26,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:47:26,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:47:26,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:47:26,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:47:26,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:47:26,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:47:26,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:47:26,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:47:26,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:47:26,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:47:26,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:47:26,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:47:26,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:47:26,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:47:26,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:47:26,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:47:26,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:47:26,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:47:26,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:47:26,073 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:47:26,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:47:26,073 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:47:26,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:47:26,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:47:26,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:47:26,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:47:26,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:47:26,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:47:26,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:47:26,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:47:26,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:47:26,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:47:26,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:47:26,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:47:26,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:47:26,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:47:26,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:47:26,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:47:26,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:47:26,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:47:26,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:47:26,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:47:26,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:47:26,079 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_4ab3b444-2e45-45ce-a314-773b2de76664/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 -> 5c4bbd5742ee42b28c0926d836f34d49923e4f62 [2019-11-19 23:47:26,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:47:26,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:47:26,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:47:26,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:47:26,250 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:47:26,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2019-11-19 23:47:26,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/data/202b09933/1d6c8f402ace42d39380374f96828692/FLAG3207939c0 [2019-11-19 23:47:26,915 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:47:26,916 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2019-11-19 23:47:26,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/data/202b09933/1d6c8f402ace42d39380374f96828692/FLAG3207939c0 [2019-11-19 23:47:27,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/data/202b09933/1d6c8f402ace42d39380374f96828692 [2019-11-19 23:47:27,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:47:27,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:47:27,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:47:27,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:47:27,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:47:27,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:47:27" (1/1) ... [2019-11-19 23:47:27,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79037fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:27, skipping insertion in model container [2019-11-19 23:47:27,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:47:27" (1/1) ... [2019-11-19 23:47:27,344 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:47:27,424 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:47:28,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:47:28,109 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:47:28,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:47:28,388 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:47:28,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28 WrapperNode [2019-11-19 23:47:28,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:47:28,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:47:28,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:47:28,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:47:28,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:47:28,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:47:28,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:47:28,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:47:28,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... [2019-11-19 23:47:28,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:47:28,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:47:28,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:47:28,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:47:28,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:47:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:47:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:47:32,489 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:47:32,489 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 23:47:32,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:47:32 BoogieIcfgContainer [2019-11-19 23:47:32,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:47:32,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:47:32,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:47:32,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:47:32,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:47:27" (1/3) ... [2019-11-19 23:47:32,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b573c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:47:32, skipping insertion in model container [2019-11-19 23:47:32,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:47:28" (2/3) ... [2019-11-19 23:47:32,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b573c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:47:32, skipping insertion in model container [2019-11-19 23:47:32,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:47:32" (3/3) ... [2019-11-19 23:47:32,504 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2019-11-19 23:47:32,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:47:32,525 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:47:32,535 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:47:32,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:47:32,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:47:32,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:47:32,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:47:32,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:47:32,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:47:32,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:47:32,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:47:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-19 23:47:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 23:47:32,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:32,617 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] [2019-11-19 23:47:32,618 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-19 23:47:32,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:32,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237151762] [2019-11-19 23:47:32,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:32,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237151762] [2019-11-19 23:47:32,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:32,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:47:32,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447200688] [2019-11-19 23:47:32,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:32,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:32,936 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-19 23:47:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:37,394 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-19 23:47:37,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:37,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-19 23:47:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:37,415 INFO L225 Difference]: With dead ends: 1466 [2019-11-19 23:47:37,415 INFO L226 Difference]: Without dead ends: 974 [2019-11-19 23:47:37,420 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-11-19 23:47:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-19 23:47:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-19 23:47:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-19 23:47:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-19 23:47:37,507 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 36 [2019-11-19 23:47:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:37,508 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-19 23:47:37,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-19 23:47:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:47:37,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:37,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:37,513 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1797553213, now seen corresponding path program 1 times [2019-11-19 23:47:37,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:37,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621846854] [2019-11-19 23:47:37,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:37,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621846854] [2019-11-19 23:47:37,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:37,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:37,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050743783] [2019-11-19 23:47:37,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:37,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:37,710 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-11-19 23:47:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:42,082 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-11-19 23:47:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:42,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 23:47:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:42,098 INFO L225 Difference]: With dead ends: 3747 [2019-11-19 23:47:42,098 INFO L226 Difference]: Without dead ends: 2777 [2019-11-19 23:47:42,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-11-19 23:47:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-11-19 23:47:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-19 23:47:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-11-19 23:47:42,160 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 101 [2019-11-19 23:47:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:42,161 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-11-19 23:47:42,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-11-19 23:47:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-19 23:47:42,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:42,168 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-19 23:47:42,169 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1703382585, now seen corresponding path program 1 times [2019-11-19 23:47:42,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:42,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356149336] [2019-11-19 23:47:42,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 23:47:42,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356149336] [2019-11-19 23:47:42,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597948819] [2019-11-19 23:47:42,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:42,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:47:42,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:47:42,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:47:42,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-19 23:47:42,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298621344] [2019-11-19 23:47:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:47:42,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:47:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:42,598 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 3 states. [2019-11-19 23:47:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:44,726 INFO L93 Difference]: Finished difference Result 7941 states and 10408 transitions. [2019-11-19 23:47:44,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:47:44,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-19 23:47:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:44,754 INFO L225 Difference]: With dead ends: 7941 [2019-11-19 23:47:44,754 INFO L226 Difference]: Without dead ends: 5168 [2019-11-19 23:47:44,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-11-19 23:47:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-11-19 23:47:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-11-19 23:47:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-11-19 23:47:44,842 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 206 [2019-11-19 23:47:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:44,844 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-11-19 23:47:44,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:47:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-11-19 23:47:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-11-19 23:47:44,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:44,853 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:45,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:47:45,057 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 815863459, now seen corresponding path program 1 times [2019-11-19 23:47:45,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:45,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072344746] [2019-11-19 23:47:45,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-19 23:47:45,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072344746] [2019-11-19 23:47:45,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:45,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:45,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940709941] [2019-11-19 23:47:45,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:47:45,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:47:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:47:45,822 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-11-19 23:47:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:50,648 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-11-19 23:47:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:50,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 386 [2019-11-19 23:47:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:50,670 INFO L225 Difference]: With dead ends: 7342 [2019-11-19 23:47:50,670 INFO L226 Difference]: Without dead ends: 4271 [2019-11-19 23:47:50,675 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-11-19 23:47:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-11-19 23:47:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-11-19 23:47:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-19 23:47:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-11-19 23:47:50,751 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 386 [2019-11-19 23:47:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:50,752 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-11-19 23:47:50,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:47:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-11-19 23:47:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-11-19 23:47:50,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:50,765 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:50,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash -63412363, now seen corresponding path program 1 times [2019-11-19 23:47:50,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:50,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377599777] [2019-11-19 23:47:50,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 23:47:51,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377599777] [2019-11-19 23:47:51,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:51,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:51,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627269197] [2019-11-19 23:47:51,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:51,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:51,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:51,338 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-11-19 23:47:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:54,016 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-11-19 23:47:54,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:54,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 460 [2019-11-19 23:47:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:54,043 INFO L225 Difference]: With dead ends: 9742 [2019-11-19 23:47:54,043 INFO L226 Difference]: Without dead ends: 5773 [2019-11-19 23:47:54,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-11-19 23:47:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-11-19 23:47:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-11-19 23:47:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-11-19 23:47:54,143 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 460 [2019-11-19 23:47:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:54,144 INFO L462 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-11-19 23:47:54,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-11-19 23:47:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-11-19 23:47:54,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:54,155 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:54,155 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash -56215097, now seen corresponding path program 1 times [2019-11-19 23:47:54,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:54,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712046335] [2019-11-19 23:47:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-19 23:47:54,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712046335] [2019-11-19 23:47:54,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:54,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:54,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317195580] [2019-11-19 23:47:54,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:54,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:54,641 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-11-19 23:47:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:57,202 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-11-19 23:47:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:57,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-11-19 23:47:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:57,227 INFO L225 Difference]: With dead ends: 10937 [2019-11-19 23:47:57,227 INFO L226 Difference]: Without dead ends: 5469 [2019-11-19 23:47:57,233 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-11-19 23:47:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-11-19 23:47:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-11-19 23:47:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-19 23:47:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-11-19 23:47:57,324 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 466 [2019-11-19 23:47:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:57,325 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-11-19 23:47:57,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-11-19 23:47:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-11-19 23:47:57,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:57,338 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 23:47:57,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1939420810, now seen corresponding path program 1 times [2019-11-19 23:47:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:47:57,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187107401] [2019-11-19 23:47:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:47:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-11-19 23:47:57,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187107401] [2019-11-19 23:47:57,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:57,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:47:57,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680812831] [2019-11-19 23:47:57,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:57,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:47:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:47:57,866 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 4 states. [2019-11-19 23:48:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:01,367 INFO L93 Difference]: Finished difference Result 17518 states and 20422 transitions. [2019-11-19 23:48:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:48:01,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-11-19 23:48:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:01,397 INFO L225 Difference]: With dead ends: 17518 [2019-11-19 23:48:01,398 INFO L226 Difference]: Without dead ends: 8466 [2019-11-19 23:48:01,406 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-11-19 23:48:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8466 states. [2019-11-19 23:48:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8466 to 7259. [2019-11-19 23:48:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-11-19 23:48:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 7879 transitions. [2019-11-19 23:48:01,513 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 7879 transitions. Word has length 489 [2019-11-19 23:48:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:01,513 INFO L462 AbstractCegarLoop]: Abstraction has 7259 states and 7879 transitions. [2019-11-19 23:48:01,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:48:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 7879 transitions. [2019-11-19 23:48:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-19 23:48:01,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:01,520 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:01,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1867065851, now seen corresponding path program 1 times [2019-11-19 23:48:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:01,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230365587] [2019-11-19 23:48:01,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-19 23:48:01,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230365587] [2019-11-19 23:48:01,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:01,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:48:01,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469220445] [2019-11-19 23:48:01,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:48:01,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:48:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:48:01,967 INFO L87 Difference]: Start difference. First operand 7259 states and 7879 transitions. Second operand 3 states. [2019-11-19 23:48:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:03,989 INFO L93 Difference]: Finished difference Result 14813 states and 16093 transitions. [2019-11-19 23:48:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:48:03,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-19 23:48:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:04,002 INFO L225 Difference]: With dead ends: 14813 [2019-11-19 23:48:04,002 INFO L226 Difference]: Without dead ends: 7556 [2019-11-19 23:48:04,008 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-11-19 23:48:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-11-19 23:48:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7257. [2019-11-19 23:48:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7257 states. [2019-11-19 23:48:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 7875 transitions. [2019-11-19 23:48:04,084 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 7875 transitions. Word has length 537 [2019-11-19 23:48:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:04,085 INFO L462 AbstractCegarLoop]: Abstraction has 7257 states and 7875 transitions. [2019-11-19 23:48:04,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:48:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 7875 transitions. [2019-11-19 23:48:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2019-11-19 23:48:04,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:04,092 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:04,092 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1537002235, now seen corresponding path program 1 times [2019-11-19 23:48:04,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:04,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885731495] [2019-11-19 23:48:04,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:48:04,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885731495] [2019-11-19 23:48:04,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:04,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:48:04,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919685933] [2019-11-19 23:48:04,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:48:04,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:48:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:48:04,730 INFO L87 Difference]: Start difference. First operand 7257 states and 7875 transitions. Second operand 6 states. [2019-11-19 23:48:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:07,813 INFO L93 Difference]: Finished difference Result 14603 states and 15841 transitions. [2019-11-19 23:48:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:48:07,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 571 [2019-11-19 23:48:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:07,828 INFO L225 Difference]: With dead ends: 14603 [2019-11-19 23:48:07,828 INFO L226 Difference]: Without dead ends: 7348 [2019-11-19 23:48:07,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:48:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states. [2019-11-19 23:48:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 7256. [2019-11-19 23:48:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-11-19 23:48:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 7806 transitions. [2019-11-19 23:48:07,913 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 7806 transitions. Word has length 571 [2019-11-19 23:48:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 7806 transitions. [2019-11-19 23:48:07,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:48:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 7806 transitions. [2019-11-19 23:48:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-11-19 23:48:07,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:07,924 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:07,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:07,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1415090238, now seen corresponding path program 1 times [2019-11-19 23:48:07,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:07,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375115134] [2019-11-19 23:48:07,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 392 proven. 34 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:48:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375115134] [2019-11-19 23:48:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684337936] [2019-11-19 23:48:08,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:48:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:08,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:48:08,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:08,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:09,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 23:48:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-11-19 23:48:09,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:48:09,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-19 23:48:09,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785116307] [2019-11-19 23:48:09,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:48:09,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:48:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:09,348 INFO L87 Difference]: Start difference. First operand 7256 states and 7806 transitions. Second operand 4 states. [2019-11-19 23:48:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:16,120 INFO L93 Difference]: Finished difference Result 19024 states and 20620 transitions. [2019-11-19 23:48:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:48:16,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 632 [2019-11-19 23:48:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:16,138 INFO L225 Difference]: With dead ends: 19024 [2019-11-19 23:48:16,138 INFO L226 Difference]: Without dead ends: 11770 [2019-11-19 23:48:16,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:48:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2019-11-19 23:48:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 9051. [2019-11-19 23:48:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9051 states. [2019-11-19 23:48:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 9789 transitions. [2019-11-19 23:48:16,249 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 9789 transitions. Word has length 632 [2019-11-19 23:48:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:16,250 INFO L462 AbstractCegarLoop]: Abstraction has 9051 states and 9789 transitions. [2019-11-19 23:48:16,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:48:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 9789 transitions. [2019-11-19 23:48:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-11-19 23:48:16,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:16,261 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:16,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:48:16,473 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1686621216, now seen corresponding path program 1 times [2019-11-19 23:48:16,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:16,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870931513] [2019-11-19 23:48:16,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 419 proven. 34 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:48:17,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870931513] [2019-11-19 23:48:17,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048104092] [2019-11-19 23:48:17,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:48:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:17,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:48:17,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:17,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:17,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:18,057 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 23 [2019-11-19 23:48:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-19 23:48:18,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:48:18,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 23:48:18,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129194980] [2019-11-19 23:48:18,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:48:18,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:48:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:48:18,413 INFO L87 Difference]: Start difference. First operand 9051 states and 9789 transitions. Second operand 3 states. [2019-11-19 23:48:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:21,890 INFO L93 Difference]: Finished difference Result 24103 states and 26050 transitions. [2019-11-19 23:48:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:48:21,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 661 [2019-11-19 23:48:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:21,915 INFO L225 Difference]: With dead ends: 24103 [2019-11-19 23:48:21,916 INFO L226 Difference]: Without dead ends: 15054 [2019-11-19 23:48:21,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:48:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15054 states. [2019-11-19 23:48:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15054 to 12347. [2019-11-19 23:48:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12347 states. [2019-11-19 23:48:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12347 states to 12347 states and 13419 transitions. [2019-11-19 23:48:22,065 INFO L78 Accepts]: Start accepts. Automaton has 12347 states and 13419 transitions. Word has length 661 [2019-11-19 23:48:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:22,066 INFO L462 AbstractCegarLoop]: Abstraction has 12347 states and 13419 transitions. [2019-11-19 23:48:22,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:48:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12347 states and 13419 transitions. [2019-11-19 23:48:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-19 23:48:22,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:22,076 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:22,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:48:22,343 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1561923461, now seen corresponding path program 1 times [2019-11-19 23:48:22,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:22,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628132759] [2019-11-19 23:48:22,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-19 23:48:22,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628132759] [2019-11-19 23:48:22,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:22,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:48:22,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733115312] [2019-11-19 23:48:22,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:48:22,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:48:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:48:22,823 INFO L87 Difference]: Start difference. First operand 12347 states and 13419 transitions. Second operand 3 states. [2019-11-19 23:48:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:24,184 INFO L93 Difference]: Finished difference Result 26784 states and 29160 transitions. [2019-11-19 23:48:24,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:48:24,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 666 [2019-11-19 23:48:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:24,197 INFO L225 Difference]: With dead ends: 26784 [2019-11-19 23:48:24,198 INFO L226 Difference]: Without dead ends: 14439 [2019-11-19 23:48:24,206 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-11-19 23:48:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14439 states. [2019-11-19 23:48:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14439 to 13841. [2019-11-19 23:48:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-11-19 23:48:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 14900 transitions. [2019-11-19 23:48:24,352 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 14900 transitions. Word has length 666 [2019-11-19 23:48:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:24,353 INFO L462 AbstractCegarLoop]: Abstraction has 13841 states and 14900 transitions. [2019-11-19 23:48:24,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:48:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 14900 transitions. [2019-11-19 23:48:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-11-19 23:48:24,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:24,369 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-19 23:48:24,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:24,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:24,369 INFO L82 PathProgramCache]: Analyzing trace with hash -408992282, now seen corresponding path program 1 times [2019-11-19 23:48:24,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:24,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568773413] [2019-11-19 23:48:24,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-19 23:48:25,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568773413] [2019-11-19 23:48:25,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:25,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:48:25,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443177286] [2019-11-19 23:48:25,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:48:25,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:48:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:48:25,148 INFO L87 Difference]: Start difference. First operand 13841 states and 14900 transitions. Second operand 3 states. [2019-11-19 23:48:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:26,766 INFO L93 Difference]: Finished difference Result 30366 states and 32681 transitions. [2019-11-19 23:48:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:48:26,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 854 [2019-11-19 23:48:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:26,778 INFO L225 Difference]: With dead ends: 30366 [2019-11-19 23:48:26,779 INFO L226 Difference]: Without dead ends: 14733 [2019-11-19 23:48:26,786 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-11-19 23:48:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14733 states. [2019-11-19 23:48:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14733 to 14134. [2019-11-19 23:48:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14134 states. [2019-11-19 23:48:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14134 states to 14134 states and 14885 transitions. [2019-11-19 23:48:26,918 INFO L78 Accepts]: Start accepts. Automaton has 14134 states and 14885 transitions. Word has length 854 [2019-11-19 23:48:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:26,919 INFO L462 AbstractCegarLoop]: Abstraction has 14134 states and 14885 transitions. [2019-11-19 23:48:26,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:48:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 14134 states and 14885 transitions. [2019-11-19 23:48:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2019-11-19 23:48:26,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:26,938 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, 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, 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, 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] [2019-11-19 23:48:26,938 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -497974071, now seen corresponding path program 1 times [2019-11-19 23:48:26,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:26,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804120253] [2019-11-19 23:48:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 1217 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-11-19 23:48:27,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804120253] [2019-11-19 23:48:27,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:27,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:48:27,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125701379] [2019-11-19 23:48:27,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:48:27,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:48:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:48:27,755 INFO L87 Difference]: Start difference. First operand 14134 states and 14885 transitions. Second operand 3 states. [2019-11-19 23:48:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:28,994 INFO L93 Difference]: Finished difference Result 31866 states and 33594 transitions. [2019-11-19 23:48:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:48:28,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 933 [2019-11-19 23:48:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:29,004 INFO L225 Difference]: With dead ends: 31866 [2019-11-19 23:48:29,004 INFO L226 Difference]: Without dead ends: 17734 [2019-11-19 23:48:29,009 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-11-19 23:48:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17734 states. [2019-11-19 23:48:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17734 to 16528. [2019-11-19 23:48:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16528 states. [2019-11-19 23:48:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 17374 transitions. [2019-11-19 23:48:29,152 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 17374 transitions. Word has length 933 [2019-11-19 23:48:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:29,153 INFO L462 AbstractCegarLoop]: Abstraction has 16528 states and 17374 transitions. [2019-11-19 23:48:29,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:48:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 17374 transitions. [2019-11-19 23:48:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2019-11-19 23:48:29,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:29,166 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-19 23:48:29,167 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash -605370242, now seen corresponding path program 1 times [2019-11-19 23:48:29,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:48:29,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323150086] [2019-11-19 23:48:29,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:48:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 507 proven. 1143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:48:32,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323150086] [2019-11-19 23:48:32,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267390021] [2019-11-19 23:48:32,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:48:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:32,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 23:48:32,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:32,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:48:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:48:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:48:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:48:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 23:48:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1076 proven. 386 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-19 23:48:35,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:48:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 23 [2019-11-19 23:48:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170464219] [2019-11-19 23:48:35,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 23:48:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:48:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 23:48:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-11-19 23:48:35,806 INFO L87 Difference]: Start difference. First operand 16528 states and 17374 transitions. Second operand 23 states. [2019-11-19 23:49:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:10,968 INFO L93 Difference]: Finished difference Result 53708 states and 56154 transitions. [2019-11-19 23:49:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-19 23:49:10,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1000 [2019-11-19 23:49:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:10,993 INFO L225 Difference]: With dead ends: 53708 [2019-11-19 23:49:10,993 INFO L226 Difference]: Without dead ends: 37182 [2019-11-19 23:49:11,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1080 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5117 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1842, Invalid=12200, Unknown=0, NotChecked=0, Total=14042 [2019-11-19 23:49:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37182 states. [2019-11-19 23:49:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37182 to 18327. [2019-11-19 23:49:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18327 states. [2019-11-19 23:49:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18327 states to 18327 states and 19197 transitions. [2019-11-19 23:49:11,219 INFO L78 Accepts]: Start accepts. Automaton has 18327 states and 19197 transitions. Word has length 1000 [2019-11-19 23:49:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:11,219 INFO L462 AbstractCegarLoop]: Abstraction has 18327 states and 19197 transitions. [2019-11-19 23:49:11,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 23:49:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18327 states and 19197 transitions. [2019-11-19 23:49:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-11-19 23:49:11,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:11,233 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:11,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:49:11,434 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -441606722, now seen corresponding path program 1 times [2019-11-19 23:49:11,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:11,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24973566] [2019-11-19 23:49:11,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-11-19 23:49:12,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24973566] [2019-11-19 23:49:12,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:12,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:49:12,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425123671] [2019-11-19 23:49:12,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:49:12,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:49:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:49:12,304 INFO L87 Difference]: Start difference. First operand 18327 states and 19197 transitions. Second operand 3 states. [2019-11-19 23:49:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:13,767 INFO L93 Difference]: Finished difference Result 40839 states and 42591 transitions. [2019-11-19 23:49:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:49:13,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1009 [2019-11-19 23:49:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:13,781 INFO L225 Difference]: With dead ends: 40839 [2019-11-19 23:49:13,781 INFO L226 Difference]: Without dead ends: 22514 [2019-11-19 23:49:13,791 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-11-19 23:49:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22514 states. [2019-11-19 23:49:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22514 to 18918. [2019-11-19 23:49:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18918 states. [2019-11-19 23:49:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18918 states to 18918 states and 19714 transitions. [2019-11-19 23:49:13,939 INFO L78 Accepts]: Start accepts. Automaton has 18918 states and 19714 transitions. Word has length 1009 [2019-11-19 23:49:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 18918 states and 19714 transitions. [2019-11-19 23:49:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:49:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 18918 states and 19714 transitions. [2019-11-19 23:49:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2019-11-19 23:49:13,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:13,958 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-19 23:49:13,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash -598383656, now seen corresponding path program 1 times [2019-11-19 23:49:13,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:49:13,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649910520] [2019-11-19 23:49:13,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:49:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4153 backedges. 2331 proven. 1012 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-11-19 23:49:16,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649910520] [2019-11-19 23:49:16,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522226883] [2019-11-19 23:49:16,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/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-11-19 23:49:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:16,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:49:16,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:16,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:49:17,233 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 34 [2019-11-19 23:49:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 23:49:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4153 backedges. 1972 proven. 12 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-19 23:49:21,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:49:21,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-11-19 23:49:21,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957876290] [2019-11-19 23:49:21,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 23:49:21,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:49:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 23:49:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:49:21,128 INFO L87 Difference]: Start difference. First operand 18918 states and 19714 transitions. Second operand 15 states. [2019-11-19 23:49:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:38,161 INFO L93 Difference]: Finished difference Result 48904 states and 50727 transitions. [2019-11-19 23:49:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-19 23:49:38,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1324 [2019-11-19 23:49:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:38,165 INFO L225 Difference]: With dead ends: 48904 [2019-11-19 23:49:38,165 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:49:38,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1368 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=647, Invalid=3013, Unknown=0, NotChecked=0, Total=3660 [2019-11-19 23:49:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:49:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:49:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:49:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:49:38,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1324 [2019-11-19 23:49:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:38,176 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:49:38,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 23:49:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:49:38,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:49:38,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:49:38,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:49:41,325 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 796 DAG size of output: 631 [2019-11-19 23:49:43,255 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 796 DAG size of output: 631 [2019-11-19 23:49:43,754 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 473 [2019-11-19 23:49:52,597 WARN L191 SmtUtils]: Spent 8.83 s on a formula simplification. DAG size of input: 610 DAG size of output: 140 [2019-11-19 23:49:58,767 WARN L191 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 610 DAG size of output: 140 [2019-11-19 23:50:02,372 WARN L191 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 463 DAG size of output: 139 [2019-11-19 23:50:02,375 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,375 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,376 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,377 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 23:50:02,378 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-19 23:50:02,379 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:50:02,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-19 23:50:02,381 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 23:50:02,382 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,383 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,384 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,385 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,386 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,387 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-19 23:50:02,388 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse20 (+ ~a4~0 86))) (let ((.cse14 (<= .cse20 0)) (.cse5 (= 5 ~a2~0))) (let ((.cse16 (+ ~a0~0 98)) (.cse2 (= 2 ~a2~0)) (.cse7 (+ ~a0~0 147)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse18 (let ((.cse24 (not .cse5))) (or (and .cse14 .cse24) (and .cse24 (<= 0 (+ ~a0~0 44)))))) (.cse10 (= 4 ~a2~0))) (let ((.cse13 (and .cse0 .cse18 .cse10)) (.cse11 (<= 276784 ~a29~0)) (.cse1 (<= .cse7 0)) (.cse12 (<= ~a29~0 43)) (.cse15 (= 3 ~a2~0)) (.cse9 (and .cse0 .cse18 .cse2)) (.cse4 (< 0 (+ ~a29~0 144))) (.cse6 (<= .cse16 0)) (.cse17 (exists ((v_prenex_2 Int)) (let ((.cse21 (div v_prenex_2 5))) (let ((.cse22 (+ .cse21 1))) (let ((.cse23 (mod .cse22 63))) (and (not (= (mod v_prenex_2 5) 0)) (= (mod .cse21 63) 0) (< v_prenex_2 0) (< .cse22 0) (not (= 0 .cse23)) (<= .cse23 (+ ~a29~0 116)))))))) (.cse3 (< 0 .cse20)) (.cse19 (<= 0 (+ ~a29~0 323344)))) (or (and .cse0 (and .cse1 .cse2)) (and .cse0 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 (< 0 .cse7) .cse5 (exists ((v_prenex_5 Int)) (let ((.cse8 (mod v_prenex_5 299928))) (and (< .cse8 599999) (not (= 0 (mod (+ .cse8 1) 5))) (not (= 0 (mod (+ .cse8 4) 5))) (< v_prenex_5 0) (not (= 0 .cse8)) (< .cse8 300071) (<= (div (+ .cse8 (- 599999)) 5) (+ ~a29~0 203344)))))) (and .cse6 .cse9) (and .cse0 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse4 .cse10) (and (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse13) (and .cse14 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input))) (and .cse6 .cse0 .cse15) (and .cse12 (and .cse0 (and .cse1 .cse10))) (and (and .cse0 .cse3 (< 0 .cse16) .cse10) .cse4) (and .cse0 .cse5 .cse17) (and .cse0 .cse18 .cse15) (and .cse0 (= 1 ~a2~0)) (and .cse13 .cse12) (and .cse11 (and .cse0 .cse15)) (and .cse14 .cse1) (and .cse0 .cse12 .cse19 .cse15) (and .cse9 .cse4) (and .cse14 .cse6 .cse17) (and .cse2 .cse3 .cse19)))))) [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,389 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,390 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,391 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,392 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,392 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse23 (+ ~a4~0 86))) (let ((.cse16 (<= .cse23 0)) (.cse5 (= 5 ~a2~0))) (let ((.cse18 (+ ~a0~0 98)) (.cse9 (= 2 ~a2~0)) (.cse12 (+ ~a0~0 147)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse19 (let ((.cse24 (not .cse5))) (or (and .cse16 .cse24) (and .cse24 (<= 0 (+ ~a0~0 44)))))) (.cse6 (= 4 ~a2~0))) (let ((.cse2 (<= 276784 ~a29~0)) (.cse3 (< 0 .cse23)) (.cse14 (and .cse0 .cse19 .cse6)) (.cse4 (< 0 (+ ~a29~0 144))) (.cse8 (<= .cse12 0)) (.cse15 (exists ((v_prenex_2 Int)) (let ((.cse20 (div v_prenex_2 5))) (let ((.cse21 (+ .cse20 1))) (let ((.cse22 (mod .cse21 63))) (and (not (= (mod v_prenex_2 5) 0)) (= (mod .cse20 63) 0) (< v_prenex_2 0) (< .cse21 0) (not (= 0 .cse22)) (<= .cse22 (+ ~a29~0 116)))))))) (.cse7 (<= ~a29~0 43)) (.cse10 (<= 0 (+ ~a29~0 323344))) (.cse17 (and .cse0 .cse19 .cse9)) (.cse11 (<= .cse18 0)) (.cse1 (= 3 ~a2~0))) (or (and (and .cse0 .cse1) .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse6 .cse2) (and .cse7 (and .cse0 (and .cse8 .cse6))) (and .cse0 .cse7 .cse4 .cse6) (and .cse3 .cse9 .cse10) (and .cse11 .cse0 .cse3 (< 0 .cse12) .cse5 (exists ((v_prenex_5 Int)) (let ((.cse13 (mod v_prenex_5 299928))) (and (< .cse13 599999) (not (= 0 (mod (+ .cse13 1) 5))) (not (= 0 (mod (+ .cse13 4) 5))) (< v_prenex_5 0) (not (= 0 .cse13)) (< .cse13 300071) (<= (div (+ .cse13 (- 599999)) 5) (+ ~a29~0 203344)))))) (and (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse14) (and .cse0 .cse5 .cse15) (and .cse16 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse17 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input))) (and (and .cse0 .cse3 (< 0 .cse18) .cse6) .cse4) (and .cse0 (and .cse8 .cse9)) (and .cse7 .cse14) (and .cse0 .cse19 .cse1) (and .cse0 (= 1 ~a2~0)) (and .cse17 .cse4) (and .cse16 .cse8) (and .cse11 (and .cse16 .cse15)) (and .cse0 .cse7 .cse10 .cse1) (and .cse11 .cse17) (and .cse11 .cse0 .cse1)))))) [2019-11-19 23:50:02,392 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,392 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 23:50:02,392 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 23:50:02,392 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,393 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,394 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,395 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,396 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 23:50:02,397 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,398 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,399 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse23 (+ ~a4~0 86))) (let ((.cse16 (<= .cse23 0)) (.cse5 (= 5 ~a2~0))) (let ((.cse18 (+ ~a0~0 98)) (.cse9 (= 2 ~a2~0)) (.cse12 (+ ~a0~0 147)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse19 (let ((.cse24 (not .cse5))) (or (and .cse16 .cse24) (and .cse24 (<= 0 (+ ~a0~0 44)))))) (.cse6 (= 4 ~a2~0))) (let ((.cse2 (<= 276784 ~a29~0)) (.cse3 (< 0 .cse23)) (.cse14 (and .cse0 .cse19 .cse6)) (.cse4 (< 0 (+ ~a29~0 144))) (.cse8 (<= .cse12 0)) (.cse15 (exists ((v_prenex_2 Int)) (let ((.cse20 (div v_prenex_2 5))) (let ((.cse21 (+ .cse20 1))) (let ((.cse22 (mod .cse21 63))) (and (not (= (mod v_prenex_2 5) 0)) (= (mod .cse20 63) 0) (< v_prenex_2 0) (< .cse21 0) (not (= 0 .cse22)) (<= .cse22 (+ ~a29~0 116)))))))) (.cse7 (<= ~a29~0 43)) (.cse10 (<= 0 (+ ~a29~0 323344))) (.cse17 (and .cse0 .cse19 .cse9)) (.cse11 (<= .cse18 0)) (.cse1 (= 3 ~a2~0))) (or (and (and .cse0 .cse1) .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse6 .cse2) (and .cse7 (and .cse0 (and .cse8 .cse6))) (and .cse0 .cse7 .cse4 .cse6) (and .cse3 .cse9 .cse10) (and .cse11 .cse0 .cse3 (< 0 .cse12) .cse5 (exists ((v_prenex_5 Int)) (let ((.cse13 (mod v_prenex_5 299928))) (and (< .cse13 599999) (not (= 0 (mod (+ .cse13 1) 5))) (not (= 0 (mod (+ .cse13 4) 5))) (< v_prenex_5 0) (not (= 0 .cse13)) (< .cse13 300071) (<= (div (+ .cse13 (- 599999)) 5) (+ ~a29~0 203344)))))) (and (exists ((v_prenex_4 Int)) (and (< 43 v_prenex_4) (<= 0 v_prenex_4) (<= (+ (mod v_prenex_4 299978) 300022) ~a29~0))) .cse14) (and .cse0 .cse5 .cse15) (and .cse16 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse17 (< 0 (+ ~a0~0 61)) (not (= 4 ULTIMATE.start_calculate_output_~input))) (and (and .cse0 .cse3 (< 0 .cse18) .cse6) .cse4) (and .cse0 (and .cse8 .cse9)) (and .cse7 .cse14) (and .cse0 .cse19 .cse1) (and .cse0 (= 1 ~a2~0)) (and .cse17 .cse4) (and .cse16 .cse8) (and .cse11 (and .cse16 .cse15)) (and .cse0 .cse7 .cse10 .cse1) (and .cse11 .cse17) (and .cse11 .cse0 .cse1)))))) [2019-11-19 23:50:02,399 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 23:50:02,399 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 23:50:02,399 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,399 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,399 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 23:50:02,400 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,401 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,402 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,403 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,404 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,405 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-19 23:50:02,406 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 23:50:02,407 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-19 23:50:02,408 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,409 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 23:50:02,410 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 23:50:02,411 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,412 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,412 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 23:50:02,412 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 23:50:02,412 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-19 23:50:02,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:50:02 BoogieIcfgContainer [2019-11-19 23:50:02,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:50:02,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:50:02,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:50:02,485 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:50:02,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:47:32" (3/4) ... [2019-11-19 23:50:02,488 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:50:02,519 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 23:50:02,522 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:50:02,550 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a4 + 42 <= 0 && 3 == a2) && 276784 <= a29) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((0 < a4 + 86 && 2 == a2) && 0 <= a29 + 323344)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) [2019-11-19 23:50:02,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a4 + 42 <= 0 && 3 == a2) && 276784 <= a29) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((0 < a4 + 86 && 2 == a2) && 0 <= a29 + 323344)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) [2019-11-19 23:50:02,562 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2) && a29 <= 43)) || (276784 <= a29 && a4 + 42 <= 0 && 3 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((2 == a2 && 0 < a4 + 86) && 0 <= a29 + 323344) [2019-11-19 23:50:02,712 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ab3b444-2e45-45ce-a314-773b2de76664/bin/uautomizer/witness.graphml [2019-11-19 23:50:02,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:50:02,713 INFO L168 Benchmark]: Toolchain (without parser) took 155389.12 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 944.7 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,713 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:50:02,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1064.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,714 INFO L168 Benchmark]: Boogie Preprocessor took 197.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,714 INFO L168 Benchmark]: RCFGBuilder took 3705.77 ms. Allocated memory is still 1.2 GB. Free memory was 993.3 MB in the beginning and 920.3 MB in the end (delta: 73.0 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,715 INFO L168 Benchmark]: TraceAbstraction took 149992.79 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 920.3 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,715 INFO L168 Benchmark]: Witness Printer took 227.20 ms. Allocated memory is still 4.6 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:02,717 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1064.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 196.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 197.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3705.77 ms. Allocated memory is still 1.2 GB. Free memory was 993.3 MB in the beginning and 920.3 MB in the end (delta: 73.0 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149992.79 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 920.3 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 227.20 ms. Allocated memory is still 4.6 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 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_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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-11-19 23:50:02,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a4 + 42 <= 0 && 3 == a2) && 276784 <= a29) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((0 < a4 + 86 && 2 == a2) && 0 <= a29 + 323344)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 23:50:02,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a4 + 42 <= 0 && 3 == a2) && 276784 <= a29) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((0 < a4 + 86 && 2 == a2) && 0 <= a29 + 323344)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0 && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-19 23:50:02,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2019-11-19 23:50:02,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-11-19 23:50:02,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 23:50:02,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 < a0 + 147) && 5 == a2) && (\exists v_prenex_5 : int :: (((((v_prenex_5 % 299928 < 599999 && !(0 == (v_prenex_5 % 299928 + 1) % 5)) && !(0 == (v_prenex_5 % 299928 + 4) % 5)) && v_prenex_5 < 0) && !(0 == v_prenex_5 % 299928)) && v_prenex_5 % 299928 < 300071) && (v_prenex_5 % 299928 + -599999) / 5 <= a29 + 203344))) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && 4 == a2) && 276784 <= a29)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 < a29 + 144) && 4 == a2)) || ((\exists v_prenex_4 : int :: (43 < v_prenex_4 && 0 <= v_prenex_4) && v_prenex_4 % 299978 + 300022 <= a29) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a0 + 61) && !(4 == input))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (a29 <= 43 && a4 + 42 <= 0 && a0 + 147 <= 0 && 4 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a0 + 98) && 4 == a2) && 0 < a29 + 144)) || ((a4 + 42 <= 0 && 5 == a2) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2)) || (a4 + 42 <= 0 && 1 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 4 == a2) && a29 <= 43)) || (276784 <= a29 && a4 + 42 <= 0 && 3 == a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a4 + 42 <= 0 && a29 <= 43) && 0 <= a29 + 323344) && 3 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a0 + 98 <= 0) && (\exists v_prenex_2 : int :: ((((!(v_prenex_2 % 5 == 0) && v_prenex_2 / 5 % 63 == 0) && v_prenex_2 < 0) && v_prenex_2 / 5 + 1 < 0) && !(0 == (v_prenex_2 / 5 + 1) % 63)) && (v_prenex_2 / 5 + 1) % 63 <= a29 + 116))) || ((2 == a2 && 0 < a4 + 86) && 0 <= a29 + 323344) - 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: 149.8s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 98.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.9s, HoareTripleCheckerStatistics: 5364 SDtfs, 40461 SDslu, 2346 SDs, 0 SdLazy, 87679 SolverSat, 8341 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 78.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4202 GetRequests, 3970 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6252 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18918occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 34583 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 519 NumberOfFragments, 1833 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1109057 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1335182 FormulaSimplificationTreeSizeReductionInter, 18.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 14154 NumberOfCodeBlocks, 14154 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 14132 ConstructedInterpolants, 736 QuantifiedInterpolants, 57293609 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4516 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 19287/21911 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...