./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label34.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/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.24-678e011 [2019-11-20 10:15:00,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:15:00,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:15:01,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:15:01,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:15:01,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:15:01,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:15:01,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:15:01,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:15:01,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:15:01,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:15:01,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:15:01,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:15:01,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:15:01,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:15:01,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:15:01,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:15:01,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:15:01,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:15:01,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:15:01,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:15:01,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:15:01,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:15:01,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:15:01,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:15:01,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:15:01,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:15:01,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:15:01,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:15:01,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:15:01,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:15:01,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:15:01,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:15:01,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:15:01,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:15:01,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:15:01,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:15:01,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:15:01,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:15:01,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:15:01,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:15:01,071 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:15:01,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:15:01,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:15:01,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:15:01,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:15:01,093 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:15:01,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:15:01,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:15:01,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:15:01,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:15:01,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:15:01,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:15:01,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:15:01,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:15:01,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:15:01,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:15:01,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:15:01,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:15:01,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:15:01,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:15:01,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:15:01,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:15:01,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:01,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:15:01,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:15:01,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:15:01,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:15:01,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:15:01,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:15:01,101 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_3792f04b-726e-4fc9-a333-8f1d5662f86a/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-11-20 10:15:01,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:15:01,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:15:01,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:15:01,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:15:01,289 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:15:01,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2019-11-20 10:15:01,361 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/data/030db777e/531146689c7a4f07a2731586dcb13035/FLAG38324feef [2019-11-20 10:15:01,972 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:15:01,972 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2019-11-20 10:15:01,997 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/data/030db777e/531146689c7a4f07a2731586dcb13035/FLAG38324feef [2019-11-20 10:15:02,139 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/data/030db777e/531146689c7a4f07a2731586dcb13035 [2019-11-20 10:15:02,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:15:02,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:15:02,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:02,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:15:02,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:15:02,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:02" (1/1) ... [2019-11-20 10:15:02,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e04513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:02, skipping insertion in model container [2019-11-20 10:15:02,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:02" (1/1) ... [2019-11-20 10:15:02,157 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:15:02,229 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:15:02,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:02,991 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:15:03,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:03,262 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:15:03,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03 WrapperNode [2019-11-20 10:15:03,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:03,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:03,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:15:03,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:15:03,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:03,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:15:03,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:15:03,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:15:03,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... [2019-11-20 10:15:03,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:15:03,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:15:03,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:15:03,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:15:03,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:15:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:15:06,784 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:15:06,785 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 10:15:06,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:06 BoogieIcfgContainer [2019-11-20 10:15:06,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:15:06,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:15:06,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:15:06,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:15:06,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:15:02" (1/3) ... [2019-11-20 10:15:06,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afb9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:06, skipping insertion in model container [2019-11-20 10:15:06,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:03" (2/3) ... [2019-11-20 10:15:06,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afb9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:06, skipping insertion in model container [2019-11-20 10:15:06,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:06" (3/3) ... [2019-11-20 10:15:06,797 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label34.c [2019-11-20 10:15:06,808 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:15:06,816 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:15:06,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:15:06,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:15:06,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:15:06,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:15:06,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:15:06,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:15:06,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:15:06,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:15:06,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:15:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-20 10:15:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:15:06,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:06,912 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-11-20 10:15:06,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-11-20 10:15:06,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:06,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482787305] [2019-11-20 10:15:06,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:07,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482787305] [2019-11-20 10:15:07,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:07,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:15:07,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363103613] [2019-11-20 10:15:07,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:15:07,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:15:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:15:07,439 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 7 states. [2019-11-20 10:15:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:13,490 INFO L93 Difference]: Finished difference Result 1815 states and 3471 transitions. [2019-11-20 10:15:13,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:15:13,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-20 10:15:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:13,520 INFO L225 Difference]: With dead ends: 1815 [2019-11-20 10:15:13,520 INFO L226 Difference]: Without dead ends: 1342 [2019-11-20 10:15:13,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:15:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-20 10:15:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 991. [2019-11-20 10:15:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-20 10:15:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2019-11-20 10:15:13,636 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 34 [2019-11-20 10:15:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:13,637 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2019-11-20 10:15:13,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:15:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2019-11-20 10:15:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 10:15:13,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:13,727 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-11-20 10:15:13,727 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1667610510, now seen corresponding path program 1 times [2019-11-20 10:15:13,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:13,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080305572] [2019-11-20 10:15:13,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:15:14,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080305572] [2019-11-20 10:15:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:14,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:15:14,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986585439] [2019-11-20 10:15:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:14,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:14,119 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand 4 states. [2019-11-20 10:15:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:16,156 INFO L93 Difference]: Finished difference Result 2638 states and 4103 transitions. [2019-11-20 10:15:16,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:15:16,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-11-20 10:15:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:16,169 INFO L225 Difference]: With dead ends: 2638 [2019-11-20 10:15:16,169 INFO L226 Difference]: Without dead ends: 1649 [2019-11-20 10:15:16,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-11-20 10:15:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-11-20 10:15:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-11-20 10:15:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions. [2019-11-20 10:15:16,226 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 224 [2019-11-20 10:15:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:16,228 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions. [2019-11-20 10:15:16,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions. [2019-11-20 10:15:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 10:15:16,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:16,238 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-11-20 10:15:16,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -518694083, now seen corresponding path program 1 times [2019-11-20 10:15:16,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:16,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064587616] [2019-11-20 10:15:16,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:15:16,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064587616] [2019-11-20 10:15:16,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:16,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:16,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853010647] [2019-11-20 10:15:16,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:16,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:16,679 INFO L87 Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand 4 states. [2019-11-20 10:15:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:19,432 INFO L93 Difference]: Finished difference Result 4612 states and 6546 transitions. [2019-11-20 10:15:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:19,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-11-20 10:15:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:19,447 INFO L225 Difference]: With dead ends: 4612 [2019-11-20 10:15:19,447 INFO L226 Difference]: Without dead ends: 2636 [2019-11-20 10:15:19,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-20 10:15:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2019-11-20 10:15:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-11-20 10:15:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2855 transitions. [2019-11-20 10:15:19,498 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 2855 transitions. Word has length 335 [2019-11-20 10:15:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:19,499 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 2855 transitions. [2019-11-20 10:15:19,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 2855 transitions. [2019-11-20 10:15:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2019-11-20 10:15:19,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:19,525 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-11-20 10:15:19,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash 689959157, now seen corresponding path program 1 times [2019-11-20 10:15:19,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:19,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754414341] [2019-11-20 10:15:19,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-20 10:15:20,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754414341] [2019-11-20 10:15:20,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:20,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:20,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069065070] [2019-11-20 10:15:20,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:20,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:20,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:20,300 INFO L87 Difference]: Start difference. First operand 2636 states and 2855 transitions. Second operand 4 states. [2019-11-20 10:15:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:21,967 INFO L93 Difference]: Finished difference Result 8231 states and 8981 transitions. [2019-11-20 10:15:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:21,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 611 [2019-11-20 10:15:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:22,002 INFO L225 Difference]: With dead ends: 8231 [2019-11-20 10:15:22,002 INFO L226 Difference]: Without dead ends: 5926 [2019-11-20 10:15:22,006 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-11-20 10:15:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-11-20 10:15:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 4939. [2019-11-20 10:15:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4939 states. [2019-11-20 10:15:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5298 transitions. [2019-11-20 10:15:22,106 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5298 transitions. Word has length 611 [2019-11-20 10:15:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:22,107 INFO L462 AbstractCegarLoop]: Abstraction has 4939 states and 5298 transitions. [2019-11-20 10:15:22,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5298 transitions. [2019-11-20 10:15:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-11-20 10:15:22,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:22,129 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-11-20 10:15:22,129 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1143515111, now seen corresponding path program 1 times [2019-11-20 10:15:22,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:22,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524922987] [2019-11-20 10:15:22,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-20 10:15:22,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524922987] [2019-11-20 10:15:22,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:22,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:22,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357599071] [2019-11-20 10:15:22,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:22,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:22,827 INFO L87 Difference]: Start difference. First operand 4939 states and 5298 transitions. Second operand 4 states. [2019-11-20 10:15:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:24,367 INFO L93 Difference]: Finished difference Result 12837 states and 13876 transitions. [2019-11-20 10:15:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:24,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 674 [2019-11-20 10:15:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:24,407 INFO L225 Difference]: With dead ends: 12837 [2019-11-20 10:15:24,408 INFO L226 Difference]: Without dead ends: 8229 [2019-11-20 10:15:24,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-11-20 10:15:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900. [2019-11-20 10:15:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-11-20 10:15:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8415 transitions. [2019-11-20 10:15:24,649 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8415 transitions. Word has length 674 [2019-11-20 10:15:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:24,650 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 8415 transitions. [2019-11-20 10:15:24,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8415 transitions. [2019-11-20 10:15:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2019-11-20 10:15:24,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:24,695 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-11-20 10:15:24,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash 4798865, now seen corresponding path program 1 times [2019-11-20 10:15:24,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:24,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199218546] [2019-11-20 10:15:24,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-11-20 10:15:25,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199218546] [2019-11-20 10:15:25,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:25,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:25,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849339314] [2019-11-20 10:15:25,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:25,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:25,713 INFO L87 Difference]: Start difference. First operand 7900 states and 8415 transitions. Second operand 4 states. [2019-11-20 10:15:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:27,084 INFO L93 Difference]: Finished difference Result 15798 states and 16838 transitions. [2019-11-20 10:15:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:27,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 947 [2019-11-20 10:15:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:27,123 INFO L225 Difference]: With dead ends: 15798 [2019-11-20 10:15:27,123 INFO L226 Difference]: Without dead ends: 8229 [2019-11-20 10:15:27,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-11-20 10:15:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-11-20 10:15:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-11-20 10:15:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8612 transitions. [2019-11-20 10:15:27,279 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8612 transitions. Word has length 947 [2019-11-20 10:15:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:27,280 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8612 transitions. [2019-11-20 10:15:27,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8612 transitions. [2019-11-20 10:15:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2019-11-20 10:15:27,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:27,317 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-11-20 10:15:27,317 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -183645654, now seen corresponding path program 1 times [2019-11-20 10:15:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:27,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874359440] [2019-11-20 10:15:27,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2386 backedges. 1731 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-11-20 10:15:29,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874359440] [2019-11-20 10:15:29,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:29,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:15:29,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518222838] [2019-11-20 10:15:29,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:15:29,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:15:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:15:29,860 INFO L87 Difference]: Start difference. First operand 8229 states and 8612 transitions. Second operand 6 states. [2019-11-20 10:15:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:32,582 INFO L93 Difference]: Finished difference Result 16794 states and 17574 transitions. [2019-11-20 10:15:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:15:32,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1230 [2019-11-20 10:15:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:32,616 INFO L225 Difference]: With dead ends: 16794 [2019-11-20 10:15:32,616 INFO L226 Difference]: Without dead ends: 8896 [2019-11-20 10:15:32,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:15:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2019-11-20 10:15:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 8558. [2019-11-20 10:15:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8558 states. [2019-11-20 10:15:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 8947 transitions. [2019-11-20 10:15:32,741 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 8947 transitions. Word has length 1230 [2019-11-20 10:15:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:32,743 INFO L462 AbstractCegarLoop]: Abstraction has 8558 states and 8947 transitions. [2019-11-20 10:15:32,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:15:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 8947 transitions. [2019-11-20 10:15:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2019-11-20 10:15:32,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:32,772 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-11-20 10:15:32,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:32,775 INFO L82 PathProgramCache]: Analyzing trace with hash 858287929, now seen corresponding path program 1 times [2019-11-20 10:15:32,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:32,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270998815] [2019-11-20 10:15:32,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 2321 proven. 0 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2019-11-20 10:15:34,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270998815] [2019-11-20 10:15:34,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:34,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:34,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495854247] [2019-11-20 10:15:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:34,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:34,471 INFO L87 Difference]: Start difference. First operand 8558 states and 8947 transitions. Second operand 4 states. [2019-11-20 10:15:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:35,933 INFO L93 Difference]: Finished difference Result 21062 states and 22023 transitions. [2019-11-20 10:15:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:35,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1355 [2019-11-20 10:15:35,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:35,956 INFO L225 Difference]: With dead ends: 21062 [2019-11-20 10:15:35,956 INFO L226 Difference]: Without dead ends: 12835 [2019-11-20 10:15:35,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-11-20 10:15:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2019-11-20 10:15:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-20 10:15:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12970 transitions. [2019-11-20 10:15:36,125 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12970 transitions. Word has length 1355 [2019-11-20 10:15:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:36,126 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12970 transitions. [2019-11-20 10:15:36,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12970 transitions. [2019-11-20 10:15:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1436 [2019-11-20 10:15:36,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:36,163 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-11-20 10:15:36,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1852286707, now seen corresponding path program 1 times [2019-11-20 10:15:36,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:36,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591059808] [2019-11-20 10:15:36,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3902 backedges. 2057 proven. 0 refuted. 0 times theorem prover too weak. 1845 trivial. 0 not checked. [2019-11-20 10:15:37,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591059808] [2019-11-20 10:15:37,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:37,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:37,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463338471] [2019-11-20 10:15:37,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:37,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:37,932 INFO L87 Difference]: Start difference. First operand 12506 states and 12970 transitions. Second operand 4 states. [2019-11-20 10:15:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:39,411 INFO L93 Difference]: Finished difference Result 27313 states and 28282 transitions. [2019-11-20 10:15:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:39,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1435 [2019-11-20 10:15:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:39,434 INFO L225 Difference]: With dead ends: 27313 [2019-11-20 10:15:39,434 INFO L226 Difference]: Without dead ends: 13493 [2019-11-20 10:15:39,448 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-11-20 10:15:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-11-20 10:15:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11848. [2019-11-20 10:15:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-11-20 10:15:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12153 transitions. [2019-11-20 10:15:39,591 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12153 transitions. Word has length 1435 [2019-11-20 10:15:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:39,592 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 12153 transitions. [2019-11-20 10:15:39,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12153 transitions. [2019-11-20 10:15:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1511 [2019-11-20 10:15:39,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:39,627 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-11-20 10:15:39,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:39,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2029366214, now seen corresponding path program 1 times [2019-11-20 10:15:39,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:39,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290611735] [2019-11-20 10:15:39,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4210 backedges. 2133 proven. 520 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2019-11-20 10:15:42,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290611735] [2019-11-20 10:15:42,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782605051] [2019-11-20 10:15:42,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:15:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:43,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 1737 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:15:43,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4210 backedges. 2436 proven. 0 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2019-11-20 10:15:44,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:15:44,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 10:15:44,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505600757] [2019-11-20 10:15:44,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:15:44,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:15:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:15:44,902 INFO L87 Difference]: Start difference. First operand 11848 states and 12153 transitions. Second operand 3 states. [2019-11-20 10:15:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:46,011 INFO L93 Difference]: Finished difference Result 23365 states and 23973 transitions. [2019-11-20 10:15:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:15:46,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1510 [2019-11-20 10:15:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:46,026 INFO L225 Difference]: With dead ends: 23365 [2019-11-20 10:15:46,026 INFO L226 Difference]: Without dead ends: 11848 [2019-11-20 10:15:46,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1519 GetRequests, 1510 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:15:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-11-20 10:15:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2019-11-20 10:15:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-11-20 10:15:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12136 transitions. [2019-11-20 10:15:46,176 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12136 transitions. Word has length 1510 [2019-11-20 10:15:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:46,180 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 12136 transitions. [2019-11-20 10:15:46,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:15:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12136 transitions. [2019-11-20 10:15:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2019-11-20 10:15:46,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:46,220 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-11-20 10:15:46,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:15:46,426 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1217713126, now seen corresponding path program 1 times [2019-11-20 10:15:46,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:46,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436400995] [2019-11-20 10:15:46,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6649 backedges. 1607 proven. 0 refuted. 0 times theorem prover too weak. 5042 trivial. 0 not checked. [2019-11-20 10:15:49,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436400995] [2019-11-20 10:15:49,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:49,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:15:49,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622340133] [2019-11-20 10:15:49,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:15:49,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:49,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:15:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:15:49,276 INFO L87 Difference]: Start difference. First operand 11848 states and 12136 transitions. Second operand 3 states. [2019-11-20 10:15:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:50,288 INFO L93 Difference]: Finished difference Result 25997 states and 26662 transitions. [2019-11-20 10:15:50,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:15:50,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1840 [2019-11-20 10:15:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:50,305 INFO L225 Difference]: With dead ends: 25997 [2019-11-20 10:15:50,305 INFO L226 Difference]: Without dead ends: 14480 [2019-11-20 10:15:50,315 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-11-20 10:15:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-11-20 10:15:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13164. [2019-11-20 10:15:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-11-20 10:15:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13470 transitions. [2019-11-20 10:15:50,453 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13470 transitions. Word has length 1840 [2019-11-20 10:15:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:50,454 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 13470 transitions. [2019-11-20 10:15:50,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:15:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13470 transitions. [2019-11-20 10:15:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1907 [2019-11-20 10:15:50,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:50,497 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-11-20 10:15:50,498 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1110509781, now seen corresponding path program 1 times [2019-11-20 10:15:50,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:50,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783236168] [2019-11-20 10:15:50,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 4858 proven. 0 refuted. 0 times theorem prover too weak. 2113 trivial. 0 not checked. [2019-11-20 10:15:54,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783236168] [2019-11-20 10:15:54,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:54,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:15:54,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367785904] [2019-11-20 10:15:54,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:15:54,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:15:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:15:54,370 INFO L87 Difference]: Start difference. First operand 13164 states and 13470 transitions. Second operand 6 states. [2019-11-20 10:15:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:56,785 INFO L93 Difference]: Finished difference Result 29945 states and 30694 transitions. [2019-11-20 10:15:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:15:56,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1906 [2019-11-20 10:15:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:56,819 INFO L225 Difference]: With dead ends: 29945 [2019-11-20 10:15:56,819 INFO L226 Difference]: Without dead ends: 17112 [2019-11-20 10:15:56,827 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-11-20 10:15:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2019-11-20 10:15:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 14151. [2019-11-20 10:15:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14151 states. [2019-11-20 10:15:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14480 transitions. [2019-11-20 10:15:56,986 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14480 transitions. Word has length 1906 [2019-11-20 10:15:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:56,987 INFO L462 AbstractCegarLoop]: Abstraction has 14151 states and 14480 transitions. [2019-11-20 10:15:56,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:15:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14480 transitions. [2019-11-20 10:15:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2019-11-20 10:15:57,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:57,024 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-11-20 10:15:57,024 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash -340138238, now seen corresponding path program 1 times [2019-11-20 10:15:57,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:57,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098975197] [2019-11-20 10:15:57,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6973 backedges. 4923 proven. 106 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2019-11-20 10:16:02,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098975197] [2019-11-20 10:16:02,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151888904] [2019-11-20 10:16:02,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:03,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 2265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:16:03,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6973 backedges. 2811 proven. 0 refuted. 0 times theorem prover too weak. 4162 trivial. 0 not checked. [2019-11-20 10:16:06,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:06,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-11-20 10:16:06,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323791012] [2019-11-20 10:16:06,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:06,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:16:06,449 INFO L87 Difference]: Start difference. First operand 14151 states and 14480 transitions. Second operand 3 states. [2019-11-20 10:16:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:07,280 INFO L93 Difference]: Finished difference Result 27971 states and 28627 transitions. [2019-11-20 10:16:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:07,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1979 [2019-11-20 10:16:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:07,294 INFO L225 Difference]: With dead ends: 27971 [2019-11-20 10:16:07,294 INFO L226 Difference]: Without dead ends: 14151 [2019-11-20 10:16:07,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1988 GetRequests, 1980 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:16:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2019-11-20 10:16:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2019-11-20 10:16:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14151 states. [2019-11-20 10:16:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14479 transitions. [2019-11-20 10:16:07,460 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14479 transitions. Word has length 1979 [2019-11-20 10:16:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:07,461 INFO L462 AbstractCegarLoop]: Abstraction has 14151 states and 14479 transitions. [2019-11-20 10:16:07,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14479 transitions. [2019-11-20 10:16:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2010 [2019-11-20 10:16:07,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:07,499 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-11-20 10:16:07,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:07,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1190378723, now seen corresponding path program 1 times [2019-11-20 10:16:07,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:07,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126171508] [2019-11-20 10:16:07,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7754 backedges. 2737 proven. 157 refuted. 0 times theorem prover too weak. 4860 trivial. 0 not checked. [2019-11-20 10:16:12,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126171508] [2019-11-20 10:16:12,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383519157] [2019-11-20 10:16:12,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:12,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:16:12,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7754 backedges. 2894 proven. 0 refuted. 0 times theorem prover too weak. 4860 trivial. 0 not checked. [2019-11-20 10:16:15,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:15,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 10:16:15,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971786956] [2019-11-20 10:16:15,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:15,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:16:15,335 INFO L87 Difference]: Start difference. First operand 14151 states and 14479 transitions. Second operand 3 states. [2019-11-20 10:16:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:16,239 INFO L93 Difference]: Finished difference Result 29287 states and 29975 transitions. [2019-11-20 10:16:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:16,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2009 [2019-11-20 10:16:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:16,249 INFO L225 Difference]: With dead ends: 29287 [2019-11-20 10:16:16,250 INFO L226 Difference]: Without dead ends: 15467 [2019-11-20 10:16:16,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2017 GetRequests, 2008 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:16:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2019-11-20 10:16:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2019-11-20 10:16:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15138 states. [2019-11-20 10:16:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15470 transitions. [2019-11-20 10:16:16,409 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15470 transitions. Word has length 2009 [2019-11-20 10:16:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:16,410 INFO L462 AbstractCegarLoop]: Abstraction has 15138 states and 15470 transitions. [2019-11-20 10:16:16,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15470 transitions. [2019-11-20 10:16:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2157 [2019-11-20 10:16:16,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:16,451 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-11-20 10:16:16,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:16,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -915672390, now seen corresponding path program 1 times [2019-11-20 10:16:16,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:16,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828003428] [2019-11-20 10:16:16,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 4471 proven. 2036 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2019-11-20 10:16:22,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828003428] [2019-11-20 10:16:22,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560067846] [2019-11-20 10:16:22,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:22,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 2468 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:16:22,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 4604 proven. 0 refuted. 0 times theorem prover too weak. 3895 trivial. 0 not checked. [2019-11-20 10:16:24,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:24,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-20 10:16:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495884095] [2019-11-20 10:16:24,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:24,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:16:24,761 INFO L87 Difference]: Start difference. First operand 15138 states and 15470 transitions. Second operand 3 states. [2019-11-20 10:16:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:25,710 INFO L93 Difference]: Finished difference Result 30274 states and 30940 transitions. [2019-11-20 10:16:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:25,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2156 [2019-11-20 10:16:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:25,723 INFO L225 Difference]: With dead ends: 30274 [2019-11-20 10:16:25,723 INFO L226 Difference]: Without dead ends: 15467 [2019-11-20 10:16:25,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2167 GetRequests, 2156 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:16:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2019-11-20 10:16:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2019-11-20 10:16:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15138 states. [2019-11-20 10:16:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15469 transitions. [2019-11-20 10:16:25,858 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15469 transitions. Word has length 2156 [2019-11-20 10:16:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:25,859 INFO L462 AbstractCegarLoop]: Abstraction has 15138 states and 15469 transitions. [2019-11-20 10:16:25,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15469 transitions. [2019-11-20 10:16:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2272 [2019-11-20 10:16:25,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:25,911 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-11-20 10:16:26,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:26,117 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1725489817, now seen corresponding path program 1 times [2019-11-20 10:16:26,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:26,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440185932] [2019-11-20 10:16:26,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9868 backedges. 4245 proven. 877 refuted. 0 times theorem prover too weak. 4746 trivial. 0 not checked. [2019-11-20 10:16:33,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440185932] [2019-11-20 10:16:33,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772445082] [2019-11-20 10:16:33,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:34,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 2624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:16:34,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:34,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9868 backedges. 5391 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-11-20 10:16:38,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:38,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-20 10:16:38,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214697509] [2019-11-20 10:16:38,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:38,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:38,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:16:38,278 INFO L87 Difference]: Start difference. First operand 15138 states and 15469 transitions. Second operand 3 states. [2019-11-20 10:16:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:39,710 INFO L93 Difference]: Finished difference Result 31919 states and 32656 transitions. [2019-11-20 10:16:39,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:39,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2271 [2019-11-20 10:16:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:39,727 INFO L225 Difference]: With dead ends: 31919 [2019-11-20 10:16:39,727 INFO L226 Difference]: Without dead ends: 17112 [2019-11-20 10:16:39,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2285 GetRequests, 2272 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:16:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2019-11-20 10:16:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16454. [2019-11-20 10:16:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16454 states. [2019-11-20 10:16:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16815 transitions. [2019-11-20 10:16:39,879 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16815 transitions. Word has length 2271 [2019-11-20 10:16:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:39,880 INFO L462 AbstractCegarLoop]: Abstraction has 16454 states and 16815 transitions. [2019-11-20 10:16:39,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16815 transitions. [2019-11-20 10:16:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2390 [2019-11-20 10:16:39,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:39,921 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-11-20 10:16:40,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:40,121 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2063429322, now seen corresponding path program 1 times [2019-11-20 10:16:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:40,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442141219] [2019-11-20 10:16:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10838 backedges. 2049 proven. 32 refuted. 0 times theorem prover too weak. 8757 trivial. 0 not checked. [2019-11-20 10:16:44,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442141219] [2019-11-20 10:16:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029380532] [2019-11-20 10:16:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/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-11-20 10:16:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:44,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:16:44,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:16:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10838 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 10423 trivial. 0 not checked. [2019-11-20 10:16:47,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-20 10:16:47,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671519229] [2019-11-20 10:16:47,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:47,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:47,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:16:47,601 INFO L87 Difference]: Start difference. First operand 16454 states and 16815 transitions. Second operand 3 states. [2019-11-20 10:16:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:48,563 INFO L93 Difference]: Finished difference Result 34220 states and 34967 transitions. [2019-11-20 10:16:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:48,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2389 [2019-11-20 10:16:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:48,566 INFO L225 Difference]: With dead ends: 34220 [2019-11-20 10:16:48,566 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:16:48,573 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-11-20 10:16:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:16:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:16:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:16:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:16:48,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2389 [2019-11-20 10:16:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:48,575 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:16:48,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:16:48,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:16:48,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:48,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:16:49,011 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 154 [2019-11-20 10:16:49,187 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 151 [2019-11-20 10:16:49,378 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 154 [2019-11-20 10:16:50,570 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2019-11-20 10:16:51,470 WARN L191 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 83 [2019-11-20 10:16:52,390 WARN L191 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,393 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 10:16:52,394 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L440 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse17 (= ~a12~0 8)) (.cse6 (= ~a16~0 9)) (.cse1 (= 3 ~a15~0)) (.cse14 (<= (+ ~a18~0 79) 0)) (.cse16 (+ ~a18~0 156)) (.cse12 (= ~a12~0 6))) (let ((.cse11 (not (= 12 ~a16~0))) (.cse15 (<= ~a16~0 11)) (.cse13 (= ~a12~0 5)) (.cse0 (not .cse12)) (.cse5 (<= ~a18~0 133)) (.cse8 (<= 0 (+ ~a18~0 155))) (.cse3 (or (not .cse6) (and (= 5 ~a12~0) .cse1 .cse14 (< 0 .cse16)))) (.cse2 (not .cse17)) (.cse4 (exists ((v_~a18~0_900 Int)) (let ((.cse19 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse18 (* 5 .cse19))) (and (<= 5 .cse18) (<= 0 .cse18) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse19 5) 5) ~a18~0)))))) (.cse9 (= ~a16~0 8)) (.cse10 (<= ~a18~0 134)) (.cse7 (<= 4 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse7 .cse2) (and .cse5 .cse6 .cse8 .cse7) (and .cse9 .cse10 .cse8 .cse7 .cse2) (and .cse7 .cse11 (<= (+ ~a18~0 391209) 0) .cse12) (and .cse9 (= ~a15~0 4) .cse13) (and .cse13 .cse14 .cse15 .cse7) (and .cse7 .cse11 .cse3 .cse12) (and .cse1 .cse11 .cse3) (and .cse15 .cse7 .cse13 .cse3 .cse4) (and .cse9 .cse5 .cse8 .cse7) (and .cse5 .cse0 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and .cse9 (<= .cse16 0) .cse7 .cse17) (and .cse9 .cse7 .cse2 .cse4) (and .cse6 (= ~a12~0 7) .cse7) (and .cse9 .cse10 .cse7 (= 7 ~a12~0))))) [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,395 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,396 INFO L444 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,397 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,398 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 10:16:52,399 INFO L444 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L440 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse15 (= ~a12~0 8)) (.cse10 (= ~a12~0 6)) (.cse5 (= ~a16~0 9))) (let ((.cse9 (not (= 12 ~a16~0))) (.cse8 (not .cse5)) (.cse2 (exists ((v_~a18~0_900 Int)) (let ((.cse17 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse16 (* 5 .cse17))) (and (<= 5 .cse16) (<= 0 .cse16) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse17 5) 5) ~a18~0)))))) (.cse13 (= ~a12~0 5)) (.cse12 (<= ~a16~0 11)) (.cse4 (<= ~a18~0 133)) (.cse6 (not .cse10)) (.cse11 (= 3 ~a15~0)) (.cse0 (= ~a16~0 8)) (.cse14 (<= ~a18~0 134)) (.cse7 (<= 0 (+ ~a18~0 155))) (.cse3 (not .cse15)) (.cse1 (<= 4 ~a15~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1 .cse3) (and .cse4 .cse5 .cse7 .cse1) (and .cse8 .cse1 .cse9 .cse10) (and .cse8 .cse11 .cse9) (and .cse8 .cse11 .cse2) (and .cse1 .cse9 (<= (+ ~a18~0 391209) 0) .cse10) (and .cse4 .cse8 .cse7 .cse11) (and .cse0 .cse4 .cse7 .cse1) (and .cse12 .cse8 .cse1 .cse13 .cse2) (and .cse0 .cse14 .cse1 (= 7 ~a12~0)) (and .cse0 (<= (+ ~a18~0 156) 0) .cse1 .cse15) (and .cse6 .cse11 .cse3) (and .cse0 (= ~a15~0 4) (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse13) (and .cse13 (<= (+ ~a18~0 79) 0) .cse12 .cse1) (and .cse4 .cse6 .cse11) (and .cse0 .cse14 .cse7 .cse1 .cse3) (and .cse5 (= ~a12~0 7) .cse1)))) [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,400 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,401 INFO L447 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-20 10:16:52,401 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,402 INFO L444 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,403 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 10:16:52,404 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L440 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse17 (= ~a12~0 8)) (.cse6 (= ~a16~0 9)) (.cse1 (= 3 ~a15~0)) (.cse14 (<= (+ ~a18~0 79) 0)) (.cse16 (+ ~a18~0 156)) (.cse12 (= ~a12~0 6))) (let ((.cse11 (not (= 12 ~a16~0))) (.cse15 (<= ~a16~0 11)) (.cse13 (= ~a12~0 5)) (.cse0 (not .cse12)) (.cse5 (<= ~a18~0 133)) (.cse8 (<= 0 (+ ~a18~0 155))) (.cse3 (or (not .cse6) (and (= 5 ~a12~0) .cse1 .cse14 (< 0 .cse16)))) (.cse2 (not .cse17)) (.cse4 (exists ((v_~a18~0_900 Int)) (let ((.cse19 (div (* v_~a18~0_900 10) (- 5)))) (let ((.cse18 (* 5 .cse19))) (and (<= 5 .cse18) (<= 0 .cse18) (<= (+ v_~a18~0_900 79) 0) (<= (div (* .cse19 5) 5) ~a18~0)))))) (.cse9 (= ~a16~0 8)) (.cse10 (<= ~a18~0 134)) (.cse7 (<= 4 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse7 .cse2) (and .cse5 .cse6 .cse8 .cse7) (and .cse9 .cse10 .cse8 .cse7 .cse2) (and .cse7 .cse11 (<= (+ ~a18~0 391209) 0) .cse12) (and .cse9 (= ~a15~0 4) .cse13) (and .cse13 .cse14 .cse15 .cse7) (and .cse7 .cse11 .cse3 .cse12) (and .cse1 .cse11 .cse3) (and .cse15 .cse7 .cse13 .cse3 .cse4) (and .cse9 .cse5 .cse8 .cse7) (and .cse5 .cse0 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and .cse9 (<= .cse16 0) .cse7 .cse17) (and .cse9 .cse7 .cse2 .cse4) (and .cse6 (= ~a12~0 7) .cse7) (and .cse9 .cse10 .cse7 (= 7 ~a12~0))))) [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,405 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 10:16:52,406 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,408 INFO L444 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,409 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,410 INFO L444 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:16:52,411 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,412 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,413 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,414 INFO L444 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 10:16:52,415 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,416 INFO L444 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,417 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,418 INFO L444 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,419 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,420 INFO L444 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,421 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,422 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 10:16:52,423 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,424 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,425 INFO L444 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,426 INFO L444 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,427 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 10:16:52,428 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,429 INFO L444 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,430 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 10:16:52,431 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,432 INFO L444 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,433 INFO L444 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 10:16:52,434 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,435 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,436 INFO L444 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 10:16:52,437 INFO L444 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,438 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,439 INFO L444 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 10:16:52,440 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,441 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,442 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,443 INFO L444 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-20 10:16:52,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:16:52 BoogieIcfgContainer [2019-11-20 10:16:52,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:16:52,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:16:52,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:16:52,507 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:16:52,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:06" (3/4) ... [2019-11-20 10:16:52,511 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:16:52,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 10:16:52,547 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:16:52,578 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(a12 == 6) && 3 == a15) && !(a12 == 8)) || ((3 == a15 && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || (((4 <= a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || ((3 == a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || (((a18 <= 133 && 0 <= a18 + 155) && 3 == a15) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((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))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12) [2019-11-20 10:16:52,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(a12 == 6) && 3 == a15) && !(a12 == 8)) || ((3 == a15 && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || (((4 <= a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || ((3 == a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || (((a18 <= 133 && 0 <= a18 + 155) && 3 == a15) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((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))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12) [2019-11-20 10:16:52,591 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((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)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || (((!(a16 == 9) && 4 <= a15) && !(12 == a16)) && a12 == 6)) || ((!(a16 == 9) && 3 == a15) && !(12 == a16))) || ((!(a16 == 9) && 3 == 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))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || (((a18 <= 133 && !(a16 == 9)) && 0 <= a18 + 155) && 3 == a15)) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((((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))) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || ((!(a12 == 6) && 3 == a15) && !(a12 == 8))) || (((a16 == 8 && a15 == 4) && !(3 == input)) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || ((a16 == 9 && a12 == 7) && 4 <= a15) [2019-11-20 10:16:52,775 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3792f04b-726e-4fc9-a333-8f1d5662f86a/bin/uautomizer/witness.graphml [2019-11-20 10:16:52,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:16:52,777 INFO L168 Benchmark]: Toolchain (without parser) took 110635.00 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.3 MB in the beginning and 1.6 GB in the end (delta: -687.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,778 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:16:52,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1120.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,779 INFO L168 Benchmark]: Boogie Preprocessor took 119.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,779 INFO L168 Benchmark]: RCFGBuilder took 3245.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,780 INFO L168 Benchmark]: TraceAbstraction took 105719.12 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -641.4 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,780 INFO L168 Benchmark]: Witness Printer took 269.07 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:16:52,782 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.50 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1120.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3245.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105719.12 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -641.4 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 269.07 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 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-11-20 10:16:52,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((!(a12 == 6) && 3 == a15) && !(a12 == 8)) || ((3 == a15 && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || (((4 <= a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || ((3 == a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || (((a18 <= 133 && 0 <= a18 + 155) && 3 == a15) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((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))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-20 10:16:52,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,817 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) && (\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)) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || (((!(a16 == 9) && 4 <= a15) && !(12 == a16)) && a12 == 6)) || ((!(a16 == 9) && 3 == a15) && !(12 == a16))) || ((!(a16 == 9) && 3 == 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))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || (((a18 <= 133 && !(a16 == 9)) && 0 <= a18 + 155) && 3 == a15)) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((((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))) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12)) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || ((!(a12 == 6) && 3 == a15) && !(a12 == 8))) || (((a16 == 8 && a15 == 4) && !(3 == input)) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || ((a16 == 9 && a12 == 7) && 4 <= a15) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-20 10:16:52,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] [2019-11-20 10:16:52,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((!(a12 == 6) && 3 == a15) && !(a12 == 8)) || ((3 == a15 && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || ((((a18 <= 133 && a16 == 9) && !(a12 == 6)) && 4 <= a15) && !(a12 == 8))) || (((a18 <= 133 && a16 == 9) && 0 <= a18 + 155) && 4 <= a15)) || ((((a16 == 8 && a18 <= 134) && 0 <= a18 + 155) && 4 <= a15) && !(a12 == 8))) || (((4 <= a15 && !(12 == a16)) && a18 + 391209 <= 0) && a12 == 6)) || ((a16 == 8 && a15 == 4) && a12 == 5)) || (((a12 == 5 && a18 + 79 <= 0) && a16 <= 11) && 4 <= a15)) || (((4 <= a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156))) && a12 == 6)) || ((3 == a15 && !(12 == a16)) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || ((((a16 <= 11 && 4 <= a15) && a12 == 5) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && 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))) || (((a16 == 8 && a18 <= 133) && 0 <= a18 + 155) && 4 <= a15)) || ((a18 <= 133 && !(a12 == 6)) && 3 == a15)) || (((a18 <= 133 && 0 <= a18 + 155) && 3 == a15) && (!(a16 == 9) || (((5 == a12 && 3 == a15) && a18 + 79 <= 0) && 0 < a18 + 156)))) || (((a16 == 8 && a18 + 156 <= 0) && 4 <= a15) && a12 == 8)) || (((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))) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && a18 <= 134) && 4 <= a15) && 7 == a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 105.5s, OverallIterations: 17, TraceHistogramMax: 14, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 2708 SDtfs, 9019 SDslu, 200 SDs, 0 SdLazy, 23576 SolverSat, 3584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12428 GetRequests, 12340 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s 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: 2.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 9572 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 192 NumberOfFragments, 1247 HoareAnnotationTreeSize, 4 FomulaSimplifications, 15657 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 7008 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 27.5s 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...