./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label34.c -s /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/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 2cbba2f347a5f731d69761cd1db09e4f61b27a47 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:38,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:38,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:38,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:38,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:38,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:38,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:38,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:38,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:38,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:38,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:38,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:38,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:38,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:38,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:38,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:38,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:38,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:38,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:38,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:38,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:38,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:38,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:38,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:38,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:38,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:38,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:38,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:38,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:38,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:38,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:38,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:38,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:38,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:38,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:38,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:38,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:38,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:38,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:38,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:38,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:38,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:38,736 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:38,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:38,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:38,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:38,737 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:38,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:38,737 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:38,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:38,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:38,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:38,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:38,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:38,740 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_de6c6262-64ed-4171-90fa-fdcaff67ca96/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 -> 2cbba2f347a5f731d69761cd1db09e4f61b27a47 [2019-12-07 10:07:38,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:38,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:38,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:38,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:38,850 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:38,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2019-12-07 10:07:38,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/data/abf5fe47e/66521bbbe4dc418e8f4b898d24513a82/FLAG3b2224a4e [2019-12-07 10:07:39,392 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:39,393 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2019-12-07 10:07:39,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/data/abf5fe47e/66521bbbe4dc418e8f4b898d24513a82/FLAG3b2224a4e [2019-12-07 10:07:39,919 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/data/abf5fe47e/66521bbbe4dc418e8f4b898d24513a82 [2019-12-07 10:07:39,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:39,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:39,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:39,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:39,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:39,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513371a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 10:07:39,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:39,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:40,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:40,388 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:40,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:40,540 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:40,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40 WrapperNode [2019-12-07 10:07:40,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:40,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:40,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:40,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:40,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:40,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:40,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:40,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:40,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... [2019-12-07 10:07:40,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:40,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:40,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:40,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:40,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:40,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:42,115 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:42,115 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 10:07:42,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42 BoogieIcfgContainer [2019-12-07 10:07:42,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:42,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:42,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:42,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:42,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:39" (1/3) ... [2019-12-07 10:07:42,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1ac48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:40" (2/3) ... [2019-12-07 10:07:42,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1ac48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/3) ... [2019-12-07 10:07:42,121 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label34.c [2019-12-07 10:07:42,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:42,132 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:42,139 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:42,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:42,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:42,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:42,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:42,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:42,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:42,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:42,159 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-12-07 10:07:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:07:42,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:42,182 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] [2019-12-07 10:07:42,182 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-12-07 10:07:42,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:42,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950213889] [2019-12-07 10:07:42,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:42,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950213889] [2019-12-07 10:07:42,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:42,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:07:42,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836385773] [2019-12-07 10:07:42,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:07:42,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:07:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:42,465 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 7 states. [2019-12-07 10:07:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,099 INFO L93 Difference]: Finished difference Result 1815 states and 3471 transitions. [2019-12-07 10:07:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:46,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 10:07:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:46,118 INFO L225 Difference]: With dead ends: 1815 [2019-12-07 10:07:46,118 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 10:07:46,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:07:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 10:07:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 991. [2019-12-07 10:07:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-07 10:07:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2019-12-07 10:07:46,190 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 34 [2019-12-07 10:07:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:46,191 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2019-12-07 10:07:46,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:07:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2019-12-07 10:07:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-07 10:07:46,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:46,199 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 10:07:46,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1667610510, now seen corresponding path program 1 times [2019-12-07 10:07:46,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800090058] [2019-12-07 10:07:46,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 10:07:46,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800090058] [2019-12-07 10:07:46,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:46,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:46,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54887929] [2019-12-07 10:07:46,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:46,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:46,400 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand 4 states. [2019-12-07 10:07:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,555 INFO L93 Difference]: Finished difference Result 2638 states and 4103 transitions. [2019-12-07 10:07:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:47,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-12-07 10:07:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:47,563 INFO L225 Difference]: With dead ends: 2638 [2019-12-07 10:07:47,563 INFO L226 Difference]: Without dead ends: 1649 [2019-12-07 10:07:47,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-12-07 10:07:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-12-07 10:07:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-12-07 10:07:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions. [2019-12-07 10:07:47,592 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 224 [2019-12-07 10:07:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:47,592 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions. [2019-12-07 10:07:47,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions. [2019-12-07 10:07:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 10:07:47,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,598 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash -518694083, now seen corresponding path program 1 times [2019-12-07 10:07:47,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806069831] [2019-12-07 10:07:47,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 10:07:47,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806069831] [2019-12-07 10:07:47,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:47,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:47,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486332998] [2019-12-07 10:07:47,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:47,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:47,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,802 INFO L87 Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand 4 states. [2019-12-07 10:07:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:49,429 INFO L93 Difference]: Finished difference Result 4612 states and 6546 transitions. [2019-12-07 10:07:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:49,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-12-07 10:07:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:49,441 INFO L225 Difference]: With dead ends: 4612 [2019-12-07 10:07:49,441 INFO L226 Difference]: Without dead ends: 2636 [2019-12-07 10:07:49,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-12-07 10:07:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2019-12-07 10:07:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-12-07 10:07:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2855 transitions. [2019-12-07 10:07:49,477 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 2855 transitions. Word has length 335 [2019-12-07 10:07:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:49,477 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 2855 transitions. [2019-12-07 10:07:49,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 2855 transitions. [2019-12-07 10:07:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2019-12-07 10:07:49,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:49,488 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 10:07:49,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 689959157, now seen corresponding path program 1 times [2019-12-07 10:07:49,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:49,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459908042] [2019-12-07 10:07:49,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 10:07:49,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459908042] [2019-12-07 10:07:49,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:49,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:49,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111442170] [2019-12-07 10:07:49,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:49,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:49,865 INFO L87 Difference]: Start difference. First operand 2636 states and 2855 transitions. Second operand 4 states. [2019-12-07 10:07:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:51,352 INFO L93 Difference]: Finished difference Result 8231 states and 8981 transitions. [2019-12-07 10:07:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:51,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 611 [2019-12-07 10:07:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:51,388 INFO L225 Difference]: With dead ends: 8231 [2019-12-07 10:07:51,388 INFO L226 Difference]: Without dead ends: 5926 [2019-12-07 10:07:51,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-07 10:07:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 4939. [2019-12-07 10:07:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4939 states. [2019-12-07 10:07:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5298 transitions. [2019-12-07 10:07:51,458 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5298 transitions. Word has length 611 [2019-12-07 10:07:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:51,458 INFO L462 AbstractCegarLoop]: Abstraction has 4939 states and 5298 transitions. [2019-12-07 10:07:51,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5298 transitions. [2019-12-07 10:07:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-12-07 10:07:51,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:51,464 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 10:07:51,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1143515111, now seen corresponding path program 1 times [2019-12-07 10:07:51,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:51,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929501244] [2019-12-07 10:07:51,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-12-07 10:07:51,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929501244] [2019-12-07 10:07:51,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:51,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:51,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711622345] [2019-12-07 10:07:51,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:51,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:51,825 INFO L87 Difference]: Start difference. First operand 4939 states and 5298 transitions. Second operand 4 states. [2019-12-07 10:07:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:53,040 INFO L93 Difference]: Finished difference Result 12837 states and 13876 transitions. [2019-12-07 10:07:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:53,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 674 [2019-12-07 10:07:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:53,083 INFO L225 Difference]: With dead ends: 12837 [2019-12-07 10:07:53,084 INFO L226 Difference]: Without dead ends: 8229 [2019-12-07 10:07:53,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-12-07 10:07:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900. [2019-12-07 10:07:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-12-07 10:07:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8415 transitions. [2019-12-07 10:07:53,171 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8415 transitions. Word has length 674 [2019-12-07 10:07:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:53,172 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 8415 transitions. [2019-12-07 10:07:53,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8415 transitions. [2019-12-07 10:07:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2019-12-07 10:07:53,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:53,183 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:53,183 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash 4798865, now seen corresponding path program 1 times [2019-12-07 10:07:53,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:53,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798973633] [2019-12-07 10:07:53,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-12-07 10:07:53,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798973633] [2019-12-07 10:07:53,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:53,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:53,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090425637] [2019-12-07 10:07:53,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:53,907 INFO L87 Difference]: Start difference. First operand 7900 states and 8415 transitions. Second operand 4 states. [2019-12-07 10:07:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:54,955 INFO L93 Difference]: Finished difference Result 15798 states and 16838 transitions. [2019-12-07 10:07:54,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:54,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 947 [2019-12-07 10:07:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:54,979 INFO L225 Difference]: With dead ends: 15798 [2019-12-07 10:07:54,979 INFO L226 Difference]: Without dead ends: 8229 [2019-12-07 10:07:54,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-12-07 10:07:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-12-07 10:07:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-12-07 10:07:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8612 transitions. [2019-12-07 10:07:55,060 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8612 transitions. Word has length 947 [2019-12-07 10:07:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8612 transitions. [2019-12-07 10:07:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8612 transitions. [2019-12-07 10:07:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2019-12-07 10:07:55,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:55,074 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:55,074 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -183645654, now seen corresponding path program 1 times [2019-12-07 10:07:55,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:55,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862303291] [2019-12-07 10:07:55,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 1731 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-12-07 10:07:56,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862303291] [2019-12-07 10:07:56,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:56,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:07:56,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492839208] [2019-12-07 10:07:56,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:56,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:56,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:56,879 INFO L87 Difference]: Start difference. First operand 8229 states and 8612 transitions. Second operand 6 states. [2019-12-07 10:07:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,887 INFO L93 Difference]: Finished difference Result 16794 states and 17574 transitions. [2019-12-07 10:07:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:59,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1230 [2019-12-07 10:07:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,926 INFO L225 Difference]: With dead ends: 16794 [2019-12-07 10:07:59,927 INFO L226 Difference]: Without dead ends: 8896 [2019-12-07 10:07:59,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2019-12-07 10:08:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 8558. [2019-12-07 10:08:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8558 states. [2019-12-07 10:08:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 8947 transitions. [2019-12-07 10:08:00,020 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 8947 transitions. Word has length 1230 [2019-12-07 10:08:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,021 INFO L462 AbstractCegarLoop]: Abstraction has 8558 states and 8947 transitions. [2019-12-07 10:08:00,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 8947 transitions. [2019-12-07 10:08:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2019-12-07 10:08:00,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,063 INFO L410 BasicCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 10:08:00,064 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash 858287929, now seen corresponding path program 1 times [2019-12-07 10:08:00,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016839543] [2019-12-07 10:08:00,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 2321 proven. 0 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2019-12-07 10:08:01,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016839543] [2019-12-07 10:08:01,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:01,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318423622] [2019-12-07 10:08:01,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:01,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:01,228 INFO L87 Difference]: Start difference. First operand 8558 states and 8947 transitions. Second operand 4 states. [2019-12-07 10:08:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,658 INFO L93 Difference]: Finished difference Result 21062 states and 22023 transitions. [2019-12-07 10:08:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:02,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1355 [2019-12-07 10:08:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,680 INFO L225 Difference]: With dead ends: 21062 [2019-12-07 10:08:02,680 INFO L226 Difference]: Without dead ends: 12835 [2019-12-07 10:08:02,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-12-07 10:08:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2019-12-07 10:08:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-12-07 10:08:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12970 transitions. [2019-12-07 10:08:02,796 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12970 transitions. Word has length 1355 [2019-12-07 10:08:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,797 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12970 transitions. [2019-12-07 10:08:02,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12970 transitions. [2019-12-07 10:08:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1436 [2019-12-07 10:08:02,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,816 INFO L410 BasicCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,817 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1852286707, now seen corresponding path program 1 times [2019-12-07 10:08:02,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173900625] [2019-12-07 10:08:02,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3902 backedges. 2057 proven. 0 refuted. 0 times theorem prover too weak. 1845 trivial. 0 not checked. [2019-12-07 10:08:04,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173900625] [2019-12-07 10:08:04,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:04,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:04,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562786002] [2019-12-07 10:08:04,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:04,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:04,119 INFO L87 Difference]: Start difference. First operand 12506 states and 12970 transitions. Second operand 4 states. [2019-12-07 10:08:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:05,201 INFO L93 Difference]: Finished difference Result 27313 states and 28282 transitions. [2019-12-07 10:08:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:05,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1435 [2019-12-07 10:08:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:05,212 INFO L225 Difference]: With dead ends: 27313 [2019-12-07 10:08:05,213 INFO L226 Difference]: Without dead ends: 13493 [2019-12-07 10:08:05,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-07 10:08:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11848. [2019-12-07 10:08:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-12-07 10:08:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12153 transitions. [2019-12-07 10:08:05,305 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12153 transitions. Word has length 1435 [2019-12-07 10:08:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:05,306 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 12153 transitions. [2019-12-07 10:08:05,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12153 transitions. [2019-12-07 10:08:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1511 [2019-12-07 10:08:05,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:05,325 INFO L410 BasicCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:05,325 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2029366214, now seen corresponding path program 1 times [2019-12-07 10:08:05,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:05,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801779540] [2019-12-07 10:08:05,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4210 backedges. 2133 proven. 520 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2019-12-07 10:08:07,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801779540] [2019-12-07 10:08:07,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979174950] [2019-12-07 10:08:07,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:08,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:08:08,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4210 backedges. 2436 proven. 0 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2019-12-07 10:08:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:09,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 10:08:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343739794] [2019-12-07 10:08:09,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:09,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:09,471 INFO L87 Difference]: Start difference. First operand 11848 states and 12153 transitions. Second operand 3 states. [2019-12-07 10:08:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:10,227 INFO L93 Difference]: Finished difference Result 23365 states and 23973 transitions. [2019-12-07 10:08:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:10,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1510 [2019-12-07 10:08:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:10,242 INFO L225 Difference]: With dead ends: 23365 [2019-12-07 10:08:10,242 INFO L226 Difference]: Without dead ends: 11848 [2019-12-07 10:08:10,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1519 GetRequests, 1510 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-12-07 10:08:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2019-12-07 10:08:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-12-07 10:08:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12136 transitions. [2019-12-07 10:08:10,351 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12136 transitions. Word has length 1510 [2019-12-07 10:08:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:10,352 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 12136 transitions. [2019-12-07 10:08:10,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12136 transitions. [2019-12-07 10:08:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2019-12-07 10:08:10,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:10,377 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:10,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:10,578 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1217713126, now seen corresponding path program 1 times [2019-12-07 10:08:10,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:10,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779551745] [2019-12-07 10:08:10,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6649 backedges. 1607 proven. 0 refuted. 0 times theorem prover too weak. 5042 trivial. 0 not checked. [2019-12-07 10:08:12,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779551745] [2019-12-07 10:08:12,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:12,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:12,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959806153] [2019-12-07 10:08:12,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:12,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:12,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:12,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:12,656 INFO L87 Difference]: Start difference. First operand 11848 states and 12136 transitions. Second operand 3 states. [2019-12-07 10:08:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:13,370 INFO L93 Difference]: Finished difference Result 25997 states and 26662 transitions. [2019-12-07 10:08:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:13,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1840 [2019-12-07 10:08:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:13,387 INFO L225 Difference]: With dead ends: 25997 [2019-12-07 10:08:13,387 INFO L226 Difference]: Without dead ends: 14480 [2019-12-07 10:08:13,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-12-07 10:08:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13164. [2019-12-07 10:08:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-12-07 10:08:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13470 transitions. [2019-12-07 10:08:13,495 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13470 transitions. Word has length 1840 [2019-12-07 10:08:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:13,496 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 13470 transitions. [2019-12-07 10:08:13,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13470 transitions. [2019-12-07 10:08:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1907 [2019-12-07 10:08:13,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:13,521 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:13,521 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1110509781, now seen corresponding path program 1 times [2019-12-07 10:08:13,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:13,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429491048] [2019-12-07 10:08:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 4858 proven. 0 refuted. 0 times theorem prover too weak. 2113 trivial. 0 not checked. [2019-12-07 10:08:16,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429491048] [2019-12-07 10:08:16,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:16,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:16,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206272787] [2019-12-07 10:08:16,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:16,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:16,113 INFO L87 Difference]: Start difference. First operand 13164 states and 13470 transitions. Second operand 6 states. [2019-12-07 10:08:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:17,983 INFO L93 Difference]: Finished difference Result 29945 states and 30694 transitions. [2019-12-07 10:08:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:17,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1906 [2019-12-07 10:08:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:17,994 INFO L225 Difference]: With dead ends: 29945 [2019-12-07 10:08:17,994 INFO L226 Difference]: Without dead ends: 17112 [2019-12-07 10:08:18,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2019-12-07 10:08:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 14151. [2019-12-07 10:08:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14151 states. [2019-12-07 10:08:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14480 transitions. [2019-12-07 10:08:18,108 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14480 transitions. Word has length 1906 [2019-12-07 10:08:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:18,109 INFO L462 AbstractCegarLoop]: Abstraction has 14151 states and 14480 transitions. [2019-12-07 10:08:18,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14480 transitions. [2019-12-07 10:08:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2019-12-07 10:08:18,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:18,133 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:18,133 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -340138238, now seen corresponding path program 1 times [2019-12-07 10:08:18,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:18,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666835997] [2019-12-07 10:08:18,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6973 backedges. 4923 proven. 106 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2019-12-07 10:08:22,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666835997] [2019-12-07 10:08:22,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059891267] [2019-12-07 10:08:22,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:22,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 2265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:08:22,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6973 backedges. 2811 proven. 0 refuted. 0 times theorem prover too weak. 4162 trivial. 0 not checked. [2019-12-07 10:08:25,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:25,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-12-07 10:08:25,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414507216] [2019-12-07 10:08:25,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:25,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:25,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:25,294 INFO L87 Difference]: Start difference. First operand 14151 states and 14480 transitions. Second operand 3 states. [2019-12-07 10:08:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:25,911 INFO L93 Difference]: Finished difference Result 27971 states and 28627 transitions. [2019-12-07 10:08:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:25,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1979 [2019-12-07 10:08:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:25,921 INFO L225 Difference]: With dead ends: 27971 [2019-12-07 10:08:25,921 INFO L226 Difference]: Without dead ends: 14151 [2019-12-07 10:08:25,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1988 GetRequests, 1980 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2019-12-07 10:08:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2019-12-07 10:08:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14151 states. [2019-12-07 10:08:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14479 transitions. [2019-12-07 10:08:26,035 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14479 transitions. Word has length 1979 [2019-12-07 10:08:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:26,035 INFO L462 AbstractCegarLoop]: Abstraction has 14151 states and 14479 transitions. [2019-12-07 10:08:26,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14479 transitions. [2019-12-07 10:08:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2010 [2019-12-07 10:08:26,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:26,060 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-12-07 10:08:26,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:26,261 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1190378723, now seen corresponding path program 1 times [2019-12-07 10:08:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291708805] [2019-12-07 10:08:26,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7754 backedges. 2737 proven. 157 refuted. 0 times theorem prover too weak. 4860 trivial. 0 not checked. [2019-12-07 10:08:29,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291708805] [2019-12-07 10:08:29,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346013802] [2019-12-07 10:08:29,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:30,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:08:30,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7754 backedges. 2894 proven. 0 refuted. 0 times theorem prover too weak. 4860 trivial. 0 not checked. [2019-12-07 10:08:32,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:32,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 10:08:32,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812645274] [2019-12-07 10:08:32,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:32,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:32,314 INFO L87 Difference]: Start difference. First operand 14151 states and 14479 transitions. Second operand 3 states. [2019-12-07 10:08:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:33,035 INFO L93 Difference]: Finished difference Result 29287 states and 29975 transitions. [2019-12-07 10:08:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:33,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2009 [2019-12-07 10:08:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:33,044 INFO L225 Difference]: With dead ends: 29287 [2019-12-07 10:08:33,044 INFO L226 Difference]: Without dead ends: 15467 [2019-12-07 10:08:33,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2017 GetRequests, 2008 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2019-12-07 10:08:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2019-12-07 10:08:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15138 states. [2019-12-07 10:08:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15470 transitions. [2019-12-07 10:08:33,149 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15470 transitions. Word has length 2009 [2019-12-07 10:08:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:33,149 INFO L462 AbstractCegarLoop]: Abstraction has 15138 states and 15470 transitions. [2019-12-07 10:08:33,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15470 transitions. [2019-12-07 10:08:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2157 [2019-12-07 10:08:33,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:33,178 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:33,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:33,379 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:33,380 INFO L82 PathProgramCache]: Analyzing trace with hash -915672390, now seen corresponding path program 1 times [2019-12-07 10:08:33,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:33,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469300079] [2019-12-07 10:08:33,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 4471 proven. 2036 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2019-12-07 10:08:37,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469300079] [2019-12-07 10:08:37,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967068172] [2019-12-07 10:08:37,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:38,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 2468 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:08:38,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 4604 proven. 0 refuted. 0 times theorem prover too weak. 3895 trivial. 0 not checked. [2019-12-07 10:08:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:40,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 10:08:40,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534238522] [2019-12-07 10:08:40,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:40,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:08:40,009 INFO L87 Difference]: Start difference. First operand 15138 states and 15470 transitions. Second operand 3 states. [2019-12-07 10:08:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:40,674 INFO L93 Difference]: Finished difference Result 30274 states and 30940 transitions. [2019-12-07 10:08:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:40,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2156 [2019-12-07 10:08:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:40,684 INFO L225 Difference]: With dead ends: 30274 [2019-12-07 10:08:40,685 INFO L226 Difference]: Without dead ends: 15467 [2019-12-07 10:08:40,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2167 GetRequests, 2156 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:08:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2019-12-07 10:08:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2019-12-07 10:08:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15138 states. [2019-12-07 10:08:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15469 transitions. [2019-12-07 10:08:40,803 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15469 transitions. Word has length 2156 [2019-12-07 10:08:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:40,804 INFO L462 AbstractCegarLoop]: Abstraction has 15138 states and 15469 transitions. [2019-12-07 10:08:40,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15469 transitions. [2019-12-07 10:08:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2272 [2019-12-07 10:08:40,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:40,836 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:41,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:41,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1725489817, now seen corresponding path program 1 times [2019-12-07 10:08:41,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:41,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958126366] [2019-12-07 10:08:41,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9868 backedges. 4245 proven. 877 refuted. 0 times theorem prover too weak. 4746 trivial. 0 not checked. [2019-12-07 10:08:47,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958126366] [2019-12-07 10:08:47,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081236063] [2019-12-07 10:08:47,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:47,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 2624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:08:47,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:47,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:47,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9868 backedges. 5391 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-12-07 10:08:50,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:50,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 10:08:50,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943914042] [2019-12-07 10:08:50,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:50,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:50,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:50,646 INFO L87 Difference]: Start difference. First operand 15138 states and 15469 transitions. Second operand 3 states. [2019-12-07 10:08:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:51,804 INFO L93 Difference]: Finished difference Result 31919 states and 32656 transitions. [2019-12-07 10:08:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2271 [2019-12-07 10:08:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:51,823 INFO L225 Difference]: With dead ends: 31919 [2019-12-07 10:08:51,823 INFO L226 Difference]: Without dead ends: 17112 [2019-12-07 10:08:51,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2285 GetRequests, 2272 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2019-12-07 10:08:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16454. [2019-12-07 10:08:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16454 states. [2019-12-07 10:08:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16815 transitions. [2019-12-07 10:08:51,947 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16815 transitions. Word has length 2271 [2019-12-07 10:08:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:51,948 INFO L462 AbstractCegarLoop]: Abstraction has 16454 states and 16815 transitions. [2019-12-07 10:08:51,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16815 transitions. [2019-12-07 10:08:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2390 [2019-12-07 10:08:51,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:51,982 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:52,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:52,183 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2063429322, now seen corresponding path program 1 times [2019-12-07 10:08:52,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:52,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636532851] [2019-12-07 10:08:52,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10838 backedges. 2049 proven. 32 refuted. 0 times theorem prover too weak. 8757 trivial. 0 not checked. [2019-12-07 10:08:55,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636532851] [2019-12-07 10:08:55,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850014596] [2019-12-07 10:08:55,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:55,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:08:55,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:55,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10838 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 10423 trivial. 0 not checked. [2019-12-07 10:08:57,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:08:57,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-12-07 10:08:57,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824111741] [2019-12-07 10:08:57,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:57,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:57,866 INFO L87 Difference]: Start difference. First operand 16454 states and 16815 transitions. Second operand 3 states. [2019-12-07 10:08:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:58,729 INFO L93 Difference]: Finished difference Result 34220 states and 34967 transitions. [2019-12-07 10:08:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:58,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2389 [2019-12-07 10:08:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:58,731 INFO L225 Difference]: With dead ends: 34220 [2019-12-07 10:08:58,731 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:08:58,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2393 GetRequests, 2389 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:08:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:08:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:08:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:08:58,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2389 [2019-12-07 10:08:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:58,739 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:08:58,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:08:58,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:08:58,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:58,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:08:59,106 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 172 [2019-12-07 10:08:59,308 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 172 [2019-12-07 10:09:00,085 WARN L192 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 82 [2019-12-07 10:09:00,874 WARN L192 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2019-12-07 10:09:02,009 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 160 DAG size of output: 82 [2019-12-07 10:09:02,011 INFO L246 CegarLoopResult]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,012 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L242 CegarLoopResult]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse7 (= ~a16~0 9)) (.cse5 (= ~a15~0 3)) (.cse10 (= ~a12~0 5)) (.cse18 (<= (+ ~a18~0 79) 0)) (.cse11 (+ ~a18~0 156)) (.cse15 (= ~a12~0 6)) (.cse12 (= ~a12~0 8))) (let ((.cse9 (= ~a12~0 7)) (.cse13 (not (= ~a16~0 12))) (.cse16 (<= ~a18~0 134)) (.cse2 (not .cse12)) (.cse0 (= ~a16~0 8)) (.cse8 (<= 0 (+ ~a18~0 155))) (.cse6 (<= ~a18~0 133)) (.cse4 (not .cse15)) (.cse17 (<= ~a16~0 11)) (.cse1 (<= 4 ~a15~0)) (.cse14 (or (not .cse7) (and .cse5 .cse10 .cse18 (< 0 .cse11)))) (.cse3 (exists ((v_~a18~0_900 Int)) (let ((.cse20 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse19 (* 5 .cse20))) (and (<= 5 .cse19) (<= 0 .cse19) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse20 5) 5) ~a18~0))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2) (and .cse6 .cse7 .cse8 .cse1) (and .cse7 .cse9 .cse1) (and .cse0 (= ~a15~0 4) .cse10) (and .cse0 (<= .cse11 0) .cse1 .cse12) (and .cse1 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse9 .cse1) (and .cse6 .cse7 .cse4 .cse1 .cse2) (and .cse17 .cse1 .cse10 .cse18) (and .cse1 .cse13 (<= (+ ~a18~0 391209) 0) .cse15) (and .cse5 .cse14 .cse3) (and .cse5 .cse13 .cse14) (and .cse6 .cse8 .cse5 .cse14) (and .cse0 .cse16 .cse8 .cse1 .cse2) (and .cse0 .cse6 .cse8 .cse1) (and .cse6 .cse4 .cse5) (and .cse17 .cse1 .cse10 .cse14 .cse3)))) [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,013 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,014 INFO L246 CegarLoopResult]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 10:09:02,015 INFO L246 CegarLoopResult]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 10:09:02,016 INFO L246 CegarLoopResult]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L242 CegarLoopResult]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse15 (= ~a12~0 8)) (.cse13 (= ~a12~0 6)) (.cse10 (= ~a16~0 9))) (let ((.cse1 (not .cse10)) (.cse12 (= ~a12~0 7)) (.cse0 (<= ~a16~0 11)) (.cse3 (= ~a12~0 5)) (.cse8 (not (= ~a16~0 12))) (.cse16 (<= ~a18~0 134)) (.cse11 (<= 0 (+ ~a18~0 155))) (.cse9 (<= ~a18~0 133)) (.cse5 (not .cse13)) (.cse6 (= ~a15~0 3)) (.cse14 (= ~a16~0 8)) (.cse2 (<= 4 ~a15~0)) (.cse4 (exists ((v_~a18~0_900 Int)) (let ((.cse18 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse17 (* 5 .cse18))) (and (<= 5 .cse17) (<= 0 .cse17) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse18 5) 5) ~a18~0)))))) (.cse7 (not .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse1 .cse6 .cse8) (and .cse9 .cse10 .cse11 .cse2) (and .cse1 .cse6 .cse4) (and .cse10 .cse12 .cse2) (and .cse1 .cse2 .cse8 .cse13) (and .cse14 (<= (+ ~a18~0 156) 0) .cse2 .cse15) (and .cse9 .cse1 .cse11 .cse6) (and .cse14 (= ~a15~0 4) (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse14 .cse16 .cse12 .cse2) (and .cse9 .cse10 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse3 (<= (+ ~a18~0 79) 0)) (and .cse2 .cse8 (<= (+ ~a18~0 391209) 0) .cse13) (and .cse14 .cse16 .cse11 .cse2 .cse7) (and .cse14 .cse9 .cse11 .cse2) (and .cse9 .cse5 .cse6) (and .cse14 .cse2 .cse4 .cse7)))) [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,017 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L249 CegarLoopResult]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,018 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,019 INFO L246 CegarLoopResult]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 10:09:02,020 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L242 CegarLoopResult]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse7 (= ~a16~0 9)) (.cse5 (= ~a15~0 3)) (.cse10 (= ~a12~0 5)) (.cse18 (<= (+ ~a18~0 79) 0)) (.cse11 (+ ~a18~0 156)) (.cse15 (= ~a12~0 6)) (.cse12 (= ~a12~0 8))) (let ((.cse9 (= ~a12~0 7)) (.cse13 (not (= ~a16~0 12))) (.cse16 (<= ~a18~0 134)) (.cse2 (not .cse12)) (.cse0 (= ~a16~0 8)) (.cse8 (<= 0 (+ ~a18~0 155))) (.cse6 (<= ~a18~0 133)) (.cse4 (not .cse15)) (.cse17 (<= ~a16~0 11)) (.cse1 (<= 4 ~a15~0)) (.cse14 (or (not .cse7) (and .cse5 .cse10 .cse18 (< 0 .cse11)))) (.cse3 (exists ((v_~a18~0_900 Int)) (let ((.cse20 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse19 (* 5 .cse20))) (and (<= 5 .cse19) (<= 0 .cse19) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse20 5) 5) ~a18~0))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2) (and .cse6 .cse7 .cse8 .cse1) (and .cse7 .cse9 .cse1) (and .cse0 (= ~a15~0 4) .cse10) (and .cse0 (<= .cse11 0) .cse1 .cse12) (and .cse1 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse9 .cse1) (and .cse6 .cse7 .cse4 .cse1 .cse2) (and .cse17 .cse1 .cse10 .cse18) (and .cse1 .cse13 (<= (+ ~a18~0 391209) 0) .cse15) (and .cse5 .cse14 .cse3) (and .cse5 .cse13 .cse14) (and .cse6 .cse8 .cse5 .cse14) (and .cse0 .cse16 .cse8 .cse1 .cse2) (and .cse0 .cse6 .cse8 .cse1) (and .cse6 .cse4 .cse5) (and .cse17 .cse1 .cse10 .cse14 .cse3)))) [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,021 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,022 INFO L246 CegarLoopResult]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,023 INFO L246 CegarLoopResult]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 10:09:02,024 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,025 INFO L246 CegarLoopResult]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,026 INFO L246 CegarLoopResult]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,027 INFO L246 CegarLoopResult]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,028 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,029 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,030 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,031 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,032 INFO L246 CegarLoopResult]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 10:09:02,033 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,034 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,035 INFO L246 CegarLoopResult]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,036 INFO L246 CegarLoopResult]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-12-07 10:09:02,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:09:02 BoogieIcfgContainer [2019-12-07 10:09:02,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:09:02,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:09:02,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:09:02,072 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:09:02,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/4) ... [2019-12-07 10:09:02,075 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:09:02,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 10:09:02,100 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:09:02,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((a16 == 8 && 4 <= a15) && !(a12 == 8)) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((4 <= a15 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((a15 == 3 && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a15 == 3 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a18 <= 133 && 0 <= a18 + 155) && a15 == 3) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) [2019-12-07 10:09:02,122 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((a16 == 8 && 4 <= a15) && !(a12 == 8)) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((4 <= a15 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((a15 == 3 && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a15 == 3 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a18 <= 133 && 0 <= a18 + 155) && a15 == 3) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) [2019-12-07 10:09:02,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a16 <= 11 && !(a16 == 9)) && 4 <= a15) && a12 == 5) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || ((!(a16 == 9) && a15 == 3) && !(a16 == 12))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((!(a16 == 9) && a15 == 3) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((!(a16 == 9) && 4 <= a15) && !(a16 == 12)) && a12 == 6)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((a18 <= 133 && !(a16 == 9)) && 0 <= a18 + 155) && a15 == 3)) || (((a16 == 8 && a15 == 4) && !(3 == input)) && a12 == 5)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || (((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) && !(a12 == 8)) [2019-12-07 10:09:02,226 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_de6c6262-64ed-4171-90fa-fdcaff67ca96/bin/uautomizer/witness.graphml [2019-12-07 10:09:02,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:09:02,227 INFO L168 Benchmark]: Toolchain (without parser) took 82305.40 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 931.7 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,227 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 931.7 MB in the beginning and 1.0 GB in the end (delta: -103.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: Boogie Preprocessor took 88.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: RCFGBuilder took 1389.96 ms. Allocated memory is still 1.1 GB. Free memory was 997.6 MB in the beginning and 976.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 188.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: TraceAbstraction took 79954.87 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 971.4 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,228 INFO L168 Benchmark]: Witness Printer took 154.57 ms. Allocated memory is still 5.0 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:02,230 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 931.7 MB in the beginning and 1.0 GB in the end (delta: -103.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1389.96 ms. Allocated memory is still 1.1 GB. Free memory was 997.6 MB in the beginning and 976.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 188.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79954.87 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 971.4 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 154.57 ms. Allocated memory is still 5.0 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.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_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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: 23]: Loop Invariant [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a16 == 8 && 4 <= a15) && !(a12 == 8)) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((4 <= a15 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((a15 == 3 && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a15 == 3 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a18 <= 133 && 0 <= a18 + 155) && a15 == 3) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) - InvariantResult [Line: 1494]: Loop Invariant [2019-12-07 10:09:02,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a16 <= 11 && !(a16 == 9)) && 4 <= a15) && a12 == 5) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || ((!(a16 == 9) && a15 == 3) && !(a16 == 12))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((!(a16 == 9) && a15 == 3) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((!(a16 == 9) && 4 <= a15) && !(a16 == 12)) && a12 == 6)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((a18 <= 133 && !(a16 == 9)) && 0 <= a18 + 155) && a15 == 3)) || (((a16 == 8 && a15 == 4) && !(3 == input)) && a12 == 5)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || (((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) && !(a12 == 8)) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-12-07 10:09:02,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-12-07 10:09:02,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a16 == 8 && 4 <= a15) && !(a12 == 8)) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) || ((!(a12 == 6) && a15 == 3) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((4 <= a15 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || (((a16 == 8 && a18 <= 134) && a12 == 7) && 4 <= a15)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a16 <= 11 && 4 <= a15) && a12 == 5) && a18 + 79 <= 0)) || (((4 <= a15 && !(a16 == 12)) && a18 + 391209 <= 0) && a12 == 6)) || ((a15 == 3 && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18))) || ((a15 == 3 && !(a16 == 12)) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a18 <= 133 && 0 <= a18 + 155) && a15 == 3) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && a15 == 3)) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((a15 == 3 && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156))) && (\exists v_~a18~0_900 : int :: ((5 <= 5 * (v_~a18~0_900 * 10 / -5) && 0 <= 5 * (v_~a18~0_900 * 10 / -5)) && v_~a18~0_900 + 79 <= 0) && v_~a18~0_900 * 10 / -5 * 5 / 5 <= a18)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 76.7s, OverallIterations: 17, TraceHistogramMax: 14, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 2708 SDtfs, 9019 SDslu, 200 SDs, 0 SdLazy, 23576 SolverSat, 3584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12428 GetRequests, 12340 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16454occurred 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.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 9572 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 192 NumberOfFragments, 1247 HoareAnnotationTreeSize, 4 FomulaSimplifications, 14210 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 8952 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 35219 NumberOfCodeBlocks, 35219 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 35196 ConstructedInterpolants, 111 QuantifiedInterpolants, 156504920 SizeOfPredicates, 2 NumberOfNonLiveVariables, 14156 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 119944/123672 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...