./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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 f418d82fd3ea296ff0e64793b35fd062187cf0a9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:37:22,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:37:22,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:37:22,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:37:22,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:37:22,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:37:22,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:37:22,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:37:22,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:37:22,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:37:22,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:37:22,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:37:22,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:37:22,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:37:22,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:37:22,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:37:22,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:37:22,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:37:22,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:37:22,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:37:22,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:37:22,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:37:22,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:37:22,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:37:22,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:37:22,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:37:22,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:37:22,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:37:22,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:37:22,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:37:22,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:37:22,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:37:22,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:37:22,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:37:22,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:37:22,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:37:22,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:37:22,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:37:22,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:37:22,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:37:22,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:37:22,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:37:22,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:37:22,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:37:22,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:37:22,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:37:22,300 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:37:22,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:37:22,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:37:22,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:37:22,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:37:22,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:37:22,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:37:22,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:37:22,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:37:22,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:37:22,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:37:22,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:37:22,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:37:22,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:37:22,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:37:22,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:37:22,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:37:22,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:37:22,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:37:22,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:37:22,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:37:22,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:37:22,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:37:22,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:37:22,306 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_26454044-9760-48d1-89c1-e9a941e90adb/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 -> f418d82fd3ea296ff0e64793b35fd062187cf0a9 [2019-11-15 21:37:22,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:37:22,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:37:22,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:37:22,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:37:22,345 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:37:22,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2019-11-15 21:37:22,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/data/d5d616cec/d7bcb7513cea4bd9b6c3b9482b21d075/FLAGeb5474fee [2019-11-15 21:37:22,908 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:37:22,908 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2019-11-15 21:37:22,922 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/data/d5d616cec/d7bcb7513cea4bd9b6c3b9482b21d075/FLAGeb5474fee [2019-11-15 21:37:23,364 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/data/d5d616cec/d7bcb7513cea4bd9b6c3b9482b21d075 [2019-11-15 21:37:23,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:37:23,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:37:23,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:37:23,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:37:23,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:37:23,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:37:23" (1/1) ... [2019-11-15 21:37:23,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ddfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:23, skipping insertion in model container [2019-11-15 21:37:23,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:37:23" (1/1) ... [2019-11-15 21:37:23,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:37:23,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:37:23,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:37:23,908 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:37:24,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:37:24,061 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:37:24,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24 WrapperNode [2019-11-15 21:37:24,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:37:24,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:37:24,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:37:24,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:37:24,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:37:24,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:37:24,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:37:24,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:37:24,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... [2019-11-15 21:37:24,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:37:24,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:37:24,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:37:24,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:37:24,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:37:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:37:25,909 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:37:25,910 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:37:25,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:37:25 BoogieIcfgContainer [2019-11-15 21:37:25,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:37:25,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:37:25,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:37:25,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:37:25,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:37:23" (1/3) ... [2019-11-15 21:37:25,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb0c618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:37:25, skipping insertion in model container [2019-11-15 21:37:25,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:37:24" (2/3) ... [2019-11-15 21:37:25,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb0c618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:37:25, skipping insertion in model container [2019-11-15 21:37:25,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:37:25" (3/3) ... [2019-11-15 21:37:25,923 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label59.c [2019-11-15 21:37:25,933 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:37:25,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:37:25,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:37:25,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:37:25,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:37:25,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:37:25,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:37:25,985 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:37:25,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:37:25,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:37:25,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:37:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 21:37:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:37:26,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:26,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:37:26,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2019-11-15 21:37:26,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:26,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609504923] [2019-11-15 21:37:26,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:26,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:26,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:26,233 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-15 21:37:26,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609504923] [2019-11-15 21:37:26,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:37:26,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:37:26,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749548697] [2019-11-15 21:37:26,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:37:26,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:37:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:37:26,255 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 21:37:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:28,163 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-15 21:37:28,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:37:28,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-15 21:37:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:28,180 INFO L225 Difference]: With dead ends: 850 [2019-11-15 21:37:28,180 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 21:37:28,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:37:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 21:37:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 21:37:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 21:37:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-15 21:37:28,263 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 40 [2019-11-15 21:37:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:28,264 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-15 21:37:28,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:37:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-15 21:37:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 21:37:28,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:28,269 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:37:28,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 335241793, now seen corresponding path program 1 times [2019-11-15 21:37:28,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:28,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797117416] [2019-11-15 21:37:28,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:28,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:28,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:37:28,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797117416] [2019-11-15 21:37:28,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:37:28,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:37:28,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519900368] [2019-11-15 21:37:28,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:37:28,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:37:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:37:28,437 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-15 21:37:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:29,661 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-11-15 21:37:29,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:37:29,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 21:37:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:29,674 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 21:37:29,674 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 21:37:29,677 INFO L600 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-15 21:37:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 21:37:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-15 21:37:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 21:37:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1982 transitions. [2019-11-15 21:37:29,759 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1982 transitions. Word has length 106 [2019-11-15 21:37:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:29,759 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1982 transitions. [2019-11-15 21:37:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:37:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1982 transitions. [2019-11-15 21:37:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 21:37:29,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:29,764 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:37:29,765 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1532171556, now seen corresponding path program 1 times [2019-11-15 21:37:29,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:29,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765978234] [2019-11-15 21:37:29,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:29,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:29,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:37:29,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765978234] [2019-11-15 21:37:29,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:37:29,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:37:29,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574514476] [2019-11-15 21:37:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:37:29,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:37:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:37:29,918 INFO L87 Difference]: Start difference. First operand 1428 states and 1982 transitions. Second operand 4 states. [2019-11-15 21:37:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:31,110 INFO L93 Difference]: Finished difference Result 4458 states and 6113 transitions. [2019-11-15 21:37:31,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:37:31,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-15 21:37:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:31,126 INFO L225 Difference]: With dead ends: 4458 [2019-11-15 21:37:31,126 INFO L226 Difference]: Without dead ends: 3032 [2019-11-15 21:37:31,129 INFO L600 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-15 21:37:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-11-15 21:37:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 3030. [2019-11-15 21:37:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-15 21:37:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3856 transitions. [2019-11-15 21:37:31,202 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3856 transitions. Word has length 108 [2019-11-15 21:37:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:31,203 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3856 transitions. [2019-11-15 21:37:31,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:37:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3856 transitions. [2019-11-15 21:37:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 21:37:31,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:31,206 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:37:31,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1707496834, now seen corresponding path program 1 times [2019-11-15 21:37:31,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:31,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418446773] [2019-11-15 21:37:31,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:31,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:31,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:37:31,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418446773] [2019-11-15 21:37:31,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:37:31,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:37:31,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465155645] [2019-11-15 21:37:31,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:37:31,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:37:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:37:31,326 INFO L87 Difference]: Start difference. First operand 3030 states and 3856 transitions. Second operand 3 states. [2019-11-15 21:37:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:31,996 INFO L93 Difference]: Finished difference Result 6948 states and 8861 transitions. [2019-11-15 21:37:31,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:37:31,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 21:37:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:32,015 INFO L225 Difference]: With dead ends: 6948 [2019-11-15 21:37:32,015 INFO L226 Difference]: Without dead ends: 3920 [2019-11-15 21:37:32,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:37:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-15 21:37:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3030. [2019-11-15 21:37:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-15 21:37:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3835 transitions. [2019-11-15 21:37:32,082 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3835 transitions. Word has length 120 [2019-11-15 21:37:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:32,083 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3835 transitions. [2019-11-15 21:37:32,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:37:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3835 transitions. [2019-11-15 21:37:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 21:37:32,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:32,086 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:37:32,087 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1520336677, now seen corresponding path program 1 times [2019-11-15 21:37:32,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:32,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475548198] [2019-11-15 21:37:32,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:32,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:37:32,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475548198] [2019-11-15 21:37:32,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627481950] [2019-11-15 21:37:32,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:32,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:37:32,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:37:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 21:37:32,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:37:32,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 21:37:32,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548012533] [2019-11-15 21:37:32,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:37:32,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:32,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:37:32,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:32,579 INFO L87 Difference]: Start difference. First operand 3030 states and 3835 transitions. Second operand 3 states. [2019-11-15 21:37:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:33,265 INFO L93 Difference]: Finished difference Result 5880 states and 7484 transitions. [2019-11-15 21:37:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:37:33,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-15 21:37:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:33,279 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 21:37:33,280 INFO L226 Difference]: Without dead ends: 2852 [2019-11-15 21:37:33,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-15 21:37:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1962. [2019-11-15 21:37:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-15 21:37:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2498 transitions. [2019-11-15 21:37:33,331 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2498 transitions. Word has length 211 [2019-11-15 21:37:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:33,334 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2498 transitions. [2019-11-15 21:37:33,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:37:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2498 transitions. [2019-11-15 21:37:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-15 21:37:33,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:33,342 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:37:33,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:37:33,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 616710149, now seen corresponding path program 1 times [2019-11-15 21:37:33,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:33,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501329802] [2019-11-15 21:37:33,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:33,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:33,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 249 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-15 21:37:33,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501329802] [2019-11-15 21:37:33,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588867562] [2019-11-15 21:37:33,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:34,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:37:34,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:37:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-15 21:37:34,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:37:34,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 21:37:34,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142482302] [2019-11-15 21:37:34,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:37:34,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:37:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:34,132 INFO L87 Difference]: Start difference. First operand 1962 states and 2498 transitions. Second operand 3 states. [2019-11-15 21:37:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:34,797 INFO L93 Difference]: Finished difference Result 3566 states and 4614 transitions. [2019-11-15 21:37:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:37:34,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-11-15 21:37:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:34,809 INFO L225 Difference]: With dead ends: 3566 [2019-11-15 21:37:34,809 INFO L226 Difference]: Without dead ends: 1962 [2019-11-15 21:37:34,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-15 21:37:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-15 21:37:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-15 21:37:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2099 transitions. [2019-11-15 21:37:34,854 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2099 transitions. Word has length 351 [2019-11-15 21:37:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:34,855 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2099 transitions. [2019-11-15 21:37:34,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:37:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2099 transitions. [2019-11-15 21:37:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-11-15 21:37:34,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:34,866 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:37:35,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:37:35,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 107446009, now seen corresponding path program 1 times [2019-11-15 21:37:35,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:35,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894046809] [2019-11-15 21:37:35,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:35,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:35,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 410 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 21:37:35,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894046809] [2019-11-15 21:37:35,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995916282] [2019-11-15 21:37:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:35,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:37:35,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:37:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:37:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 391 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 21:37:36,202 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:37:36,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 21:37:36,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85928681] [2019-11-15 21:37:36,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:37:36,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:37:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:37:36,204 INFO L87 Difference]: Start difference. First operand 1784 states and 2099 transitions. Second operand 8 states. [2019-11-15 21:37:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:38,625 INFO L93 Difference]: Finished difference Result 3593 states and 4253 transitions. [2019-11-15 21:37:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:37:38,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 444 [2019-11-15 21:37:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:38,635 INFO L225 Difference]: With dead ends: 3593 [2019-11-15 21:37:38,635 INFO L226 Difference]: Without dead ends: 1989 [2019-11-15 21:37:38,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:37:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-11-15 21:37:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1784. [2019-11-15 21:37:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-15 21:37:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2087 transitions. [2019-11-15 21:37:38,670 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2087 transitions. Word has length 444 [2019-11-15 21:37:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:38,671 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2087 transitions. [2019-11-15 21:37:38,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:37:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2087 transitions. [2019-11-15 21:37:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-15 21:37:38,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:38,684 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:37:38,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:37:38,891 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -142907616, now seen corresponding path program 1 times [2019-11-15 21:37:38,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:38,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531319183] [2019-11-15 21:37:38,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:38,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:38,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 357 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-15 21:37:39,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531319183] [2019-11-15 21:37:39,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89528010] [2019-11-15 21:37:39,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:39,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:37:39,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:37:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-15 21:37:39,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:37:39,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 21:37:39,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757131876] [2019-11-15 21:37:39,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:37:39,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:37:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:39,829 INFO L87 Difference]: Start difference. First operand 1784 states and 2087 transitions. Second operand 4 states. [2019-11-15 21:37:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:40,765 INFO L93 Difference]: Finished difference Result 3595 states and 4201 transitions. [2019-11-15 21:37:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:37:40,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-15 21:37:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:40,774 INFO L225 Difference]: With dead ends: 3595 [2019-11-15 21:37:40,775 INFO L226 Difference]: Without dead ends: 1962 [2019-11-15 21:37:40,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:37:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-15 21:37:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-15 21:37:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-15 21:37:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1913 transitions. [2019-11-15 21:37:40,807 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1913 transitions. Word has length 526 [2019-11-15 21:37:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:40,808 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 1913 transitions. [2019-11-15 21:37:40,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:37:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1913 transitions. [2019-11-15 21:37:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-15 21:37:40,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:40,827 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:37:41,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:37:41,039 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:41,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1409455003, now seen corresponding path program 1 times [2019-11-15 21:37:41,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:41,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064283059] [2019-11-15 21:37:41,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:41,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:41,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 926 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-15 21:37:42,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064283059] [2019-11-15 21:37:42,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:37:42,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:37:42,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303527024] [2019-11-15 21:37:42,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:37:42,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:42,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:37:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:37:42,217 INFO L87 Difference]: Start difference. First operand 1784 states and 1913 transitions. Second operand 8 states. [2019-11-15 21:37:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:43,597 INFO L93 Difference]: Finished difference Result 3572 states and 3839 transitions. [2019-11-15 21:37:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:37:43,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 662 [2019-11-15 21:37:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:43,607 INFO L225 Difference]: With dead ends: 3572 [2019-11-15 21:37:43,607 INFO L226 Difference]: Without dead ends: 1968 [2019-11-15 21:37:43,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:37:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-15 21:37:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1962. [2019-11-15 21:37:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-15 21:37:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2093 transitions. [2019-11-15 21:37:43,640 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2093 transitions. Word has length 662 [2019-11-15 21:37:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:43,641 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2093 transitions. [2019-11-15 21:37:43,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:37:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2093 transitions. [2019-11-15 21:37:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2019-11-15 21:37:43,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:37:43,648 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-15 21:37:43,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:37:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:37:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2096537786, now seen corresponding path program 1 times [2019-11-15 21:37:43,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:37:43,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592714889] [2019-11-15 21:37:43,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:43,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:37:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:37:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 775 proven. 182 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-15 21:37:44,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592714889] [2019-11-15 21:37:44,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467142124] [2019-11-15 21:37:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/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-15 21:37:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:37:44,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:37:44,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:37:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:37:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:37:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 990 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 21:37:45,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:37:45,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-11-15 21:37:45,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304212612] [2019-11-15 21:37:45,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:37:45,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:37:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:37:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:37:45,357 INFO L87 Difference]: Start difference. First operand 1962 states and 2093 transitions. Second operand 5 states. [2019-11-15 21:37:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:37:46,947 INFO L93 Difference]: Finished difference Result 4810 states and 5190 transitions. [2019-11-15 21:37:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:37:46,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 688 [2019-11-15 21:37:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:37:46,948 INFO L225 Difference]: With dead ends: 4810 [2019-11-15 21:37:46,949 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:37:46,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 688 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:37:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:37:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:37:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:37:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:37:46,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 688 [2019-11-15 21:37:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:37:46,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:37:46,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:37:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:37:46,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:37:47,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:37:47,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:37:47,531 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-11-15 21:37:47,809 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-11-15 21:37:47,811 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 21:37:47,811 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 21:37:47,811 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,812 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:37:47,813 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,814 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,818 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 21:37:47,818 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:37:47,818 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 21:37:47,819 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 21:37:47,820 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 21:37:47,821 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,822 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,823 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:37:47,823 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:37:47,823 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:37:47,823 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 21:37:47,823 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 21:37:47,824 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 21:37:47,824 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 21:37:47,824 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:37:47,825 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,826 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 21:37:47,827 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:37:47,828 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,829 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 21:37:47,830 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 21:37:47,831 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,832 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,832 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse1 (<= ~a12~0 11)) (.cse0 (= ~a24~0 1)) (.cse2 (not (= 6 ~a21~0)))) (or (and .cse0 .cse1 (= 10 ~a21~0)) (<= ~a15~0 7) (and .cse0 (<= 9 ~a15~0)) (and (= ~a21~0 7) .cse0 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse1 (< 0 (+ ~a12~0 43)) .cse2) (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (and .cse0 (<= 23 ~a12~0) .cse2))) [2019-11-15 21:37:47,832 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 21:37:47,832 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 21:37:47,832 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,833 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 21:37:47,834 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 21:37:47,835 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 21:37:47,836 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse1 (<= ~a12~0 11)) (.cse0 (= ~a24~0 1)) (.cse2 (not (= 6 ~a21~0)))) (or (and .cse0 .cse1 (= 10 ~a21~0)) (<= ~a15~0 7) (and .cse0 (<= 9 ~a15~0)) (and (= ~a21~0 7) .cse0 (<= (+ ~a12~0 49) 0)) (and .cse0 .cse1 (< 0 (+ ~a12~0 43)) .cse2) (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (and .cse0 (<= 23 ~a12~0) .cse2))) [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 21:37:47,837 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:37:47,838 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,839 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 21:37:47,840 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:37:47,841 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:37:47,842 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 21:37:47,842 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 21:37:47,842 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 21:37:47,842 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 21:37:47,842 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:37:47,843 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 21:37:47,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:47,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:37:47 BoogieIcfgContainer [2019-11-15 21:37:47,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:37:47,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:37:47,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:37:47,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:37:47,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:37:25" (3/4) ... [2019-11-15 21:37:47,891 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:37:47,922 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:37:47,923 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:37:47,963 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((a24 == 1 && a12 <= 11) && 10 == a21) || a15 <= 7) || (a24 == 1 && 9 <= a15)) || ((a21 == 7 && a24 == 1) && a12 + 49 <= 0)) || (((a24 == 1 && a12 <= 11) && 0 < a12 + 43) && !(6 == a21))) || ((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1)) || ((a24 == 1 && 23 <= a12) && !(6 == a21)) [2019-11-15 21:37:47,967 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((a24 == 1 && a12 <= 11) && 10 == a21) || a15 <= 7) || (a24 == 1 && 9 <= a15)) || ((a21 == 7 && a24 == 1) && a12 + 49 <= 0)) || (((a24 == 1 && a12 <= 11) && 0 < a12 + 43) && !(6 == a21))) || ((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1)) || ((a24 == 1 && 23 <= a12) && !(6 == a21)) [2019-11-15 21:37:48,117 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_26454044-9760-48d1-89c1-e9a941e90adb/bin/uautomizer/witness.graphml [2019-11-15 21:37:48,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:37:48,119 INFO L168 Benchmark]: Toolchain (without parser) took 24752.31 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 953.2 MB). Free memory was 943.3 MB in the beginning and 1.4 GB in the end (delta: -459.4 MB). Peak memory consumption was 493.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,119 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:37:48,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,120 INFO L168 Benchmark]: Boogie Preprocessor took 101.94 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,120 INFO L168 Benchmark]: RCFGBuilder took 1629.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,121 INFO L168 Benchmark]: TraceAbstraction took 21973.58 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 792.7 MB). Free memory was 979.9 MB in the beginning and 1.4 GB in the end (delta: -451.1 MB). Peak memory consumption was 341.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,121 INFO L168 Benchmark]: Witness Printer took 231.42 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:48,123 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 694.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.94 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1629.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21973.58 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 792.7 MB). Free memory was 979.9 MB in the beginning and 1.4 GB in the end (delta: -451.1 MB). Peak memory consumption was 341.6 MB. Max. memory is 11.5 GB. * Witness Printer took 231.42 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: 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: 880]: Loop Invariant [2019-11-15 21:37:48,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((a24 == 1 && a12 <= 11) && 10 == a21) || a15 <= 7) || (a24 == 1 && 9 <= a15)) || ((a21 == 7 && a24 == 1) && a12 + 49 <= 0)) || (((a24 == 1 && a12 <= 11) && 0 < a12 + 43) && !(6 == a21))) || ((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1)) || ((a24 == 1 && 23 <= a12) && !(6 == a21)) - InvariantResult [Line: 20]: Loop Invariant [2019-11-15 21:37:48,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-15 21:37:48,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((a24 == 1 && a12 <= 11) && 10 == a21) || a15 <= 7) || (a24 == 1 && 9 <= a15)) || ((a21 == 7 && a24 == 1) && a12 + 49 <= 0)) || (((a24 == 1 && a12 <= 11) && 0 < a12 + 43) && !(6 == a21))) || ((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1)) || ((a24 == 1 && 23 <= a12) && !(6 == a21)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 21.8s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1430 SDtfs, 2816 SDslu, 130 SDs, 0 SdLazy, 10021 SolverSat, 1329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2268 GetRequests, 2220 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2527 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5224 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 798 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5476 NumberOfCodeBlocks, 5476 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5461 ConstructedInterpolants, 38 QuantifiedInterpolants, 11690439 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2787 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7212/7433 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...