./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/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 e4f93eb95cdae688384271d92bae052385a66833 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:42:28,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:42:28,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:42:28,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:42:28,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:42:28,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:42:28,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:42:28,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:42:28,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:42:28,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:42:28,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:42:28,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:42:28,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:42:28,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:42:28,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:42:28,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:42:28,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:42:28,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:42:28,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:42:28,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:42:28,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:42:28,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:42:28,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:42:28,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:42:28,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:42:28,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:42:28,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:42:28,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:42:28,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:42:28,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:42:28,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:42:28,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:42:28,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:42:28,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:42:28,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:42:28,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:42:28,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:42:28,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:42:28,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:42:28,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:42:28,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:42:28,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:42:28,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:42:28,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:42:28,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:42:28,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:42:28,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:42:28,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:42:28,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:28,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:42:28,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:42:28,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:42:28,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:42:28,649 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_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/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 -> e4f93eb95cdae688384271d92bae052385a66833 [2019-12-07 12:42:28,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:42:28,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:42:28,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:42:28,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:42:28,761 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:42:28,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-12-07 12:42:28,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/data/35ae1f5b2/07e78ba4629c4aafa8286541c926a1e1/FLAG625b0e500 [2019-12-07 12:42:29,341 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:42:29,342 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-12-07 12:42:29,352 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/data/35ae1f5b2/07e78ba4629c4aafa8286541c926a1e1/FLAG625b0e500 [2019-12-07 12:42:29,841 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/data/35ae1f5b2/07e78ba4629c4aafa8286541c926a1e1 [2019-12-07 12:42:29,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:42:29,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:42:29,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:29,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:42:29,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:42:29,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:29" (1/1) ... [2019-12-07 12:42:29,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f12ee6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:29, skipping insertion in model container [2019-12-07 12:42:29,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:29" (1/1) ... [2019-12-07 12:42:29,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:42:29,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:42:30,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:30,167 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:42:30,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:30,247 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:42:30,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30 WrapperNode [2019-12-07 12:42:30,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:30,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:30,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:42:30,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:42:30,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:30,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:42:30,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:42:30,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:42:30,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:42:30,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:42:30,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:42:30,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:42:30,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:42:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:42:31,216 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:42:31,216 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:42:31,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:31 BoogieIcfgContainer [2019-12-07 12:42:31,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:42:31,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:42:31,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:42:31,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:42:31,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:42:29" (1/3) ... [2019-12-07 12:42:31,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551bd992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:31, skipping insertion in model container [2019-12-07 12:42:31,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (2/3) ... [2019-12-07 12:42:31,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551bd992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:31, skipping insertion in model container [2019-12-07 12:42:31,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:31" (3/3) ... [2019-12-07 12:42:31,222 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label04.c [2019-12-07 12:42:31,230 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:42:31,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:42:31,244 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:42:31,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:42:31,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:42:31,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:42:31,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:42:31,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:42:31,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:42:31,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:42:31,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:42:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 12:42:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:42:31,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:31,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:31,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-12-07 12:42:31,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:31,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041267391] [2019-12-07 12:42:31,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:31,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041267391] [2019-12-07 12:42:31,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:31,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:31,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798769206] [2019-12-07 12:42:31,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:31,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:31,494 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-12-07 12:42:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:32,504 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-12-07 12:42:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:32,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 12:42:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:32,519 INFO L225 Difference]: With dead ends: 850 [2019-12-07 12:42:32,519 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 12:42:32,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 12:42:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 12:42:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 12:42:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-12-07 12:42:32,571 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 52 [2019-12-07 12:42:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-12-07 12:42:32,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-12-07 12:42:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:42:32,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:32,576 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:42:32,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 106118808, now seen corresponding path program 1 times [2019-12-07 12:42:32,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:32,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261567192] [2019-12-07 12:42:32,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:32,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261567192] [2019-12-07 12:42:32,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:32,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:32,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286630319] [2019-12-07 12:42:32,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:32,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:32,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:32,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:32,670 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-12-07 12:42:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:33,446 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-12-07 12:42:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:33,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 12:42:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:33,453 INFO L225 Difference]: With dead ends: 2142 [2019-12-07 12:42:33,453 INFO L226 Difference]: Without dead ends: 1606 [2019-12-07 12:42:33,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-07 12:42:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-12-07 12:42:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 12:42:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2029 transitions. [2019-12-07 12:42:33,481 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2029 transitions. Word has length 117 [2019-12-07 12:42:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2029 transitions. [2019-12-07 12:42:33,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2029 transitions. [2019-12-07 12:42:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 12:42:33,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:33,483 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:42:33,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash -301797236, now seen corresponding path program 1 times [2019-12-07 12:42:33,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:33,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259609051] [2019-12-07 12:42:33,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:33,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259609051] [2019-12-07 12:42:33,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:33,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:42:33,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955401840] [2019-12-07 12:42:33,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:33,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:33,547 INFO L87 Difference]: Start difference. First operand 1428 states and 2029 transitions. Second operand 4 states. [2019-12-07 12:42:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:34,453 INFO L93 Difference]: Finished difference Result 4634 states and 6631 transitions. [2019-12-07 12:42:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:34,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 12:42:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:34,465 INFO L225 Difference]: With dead ends: 4634 [2019-12-07 12:42:34,465 INFO L226 Difference]: Without dead ends: 3208 [2019-12-07 12:42:34,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-12-07 12:42:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2019-12-07 12:42:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 12:42:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-12-07 12:42:34,511 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 120 [2019-12-07 12:42:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:34,511 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-12-07 12:42:34,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-12-07 12:42:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-12-07 12:42:34,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:34,516 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:34,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1455566984, now seen corresponding path program 1 times [2019-12-07 12:42:34,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:34,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863433044] [2019-12-07 12:42:34,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-12-07 12:42:34,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863433044] [2019-12-07 12:42:34,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684914437] [2019-12-07 12:42:34,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:34,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:34,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-12-07 12:42:34,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:34,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 12:42:34,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172071430] [2019-12-07 12:42:34,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:34,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:42:34,902 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 3 states. [2019-12-07 12:42:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:35,439 INFO L93 Difference]: Finished difference Result 6414 states and 8465 transitions. [2019-12-07 12:42:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:35,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-12-07 12:42:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:35,452 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 12:42:35,453 INFO L226 Difference]: Without dead ends: 3742 [2019-12-07 12:42:35,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 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-12-07 12:42:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-12-07 12:42:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2852. [2019-12-07 12:42:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 12:42:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-12-07 12:42:35,501 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 277 [2019-12-07 12:42:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:35,502 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-12-07 12:42:35,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-12-07 12:42:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 12:42:35,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:35,506 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 12:42:35,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:35,707 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1904800060, now seen corresponding path program 1 times [2019-12-07 12:42:35,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:35,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719617427] [2019-12-07 12:42:35,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 12:42:35,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719617427] [2019-12-07 12:42:35,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286379408] [2019-12-07 12:42:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:35,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:42:35,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 12:42:36,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:36,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 12:42:36,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221844214] [2019-12-07 12:42:36,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:36,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:42:36,102 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 4 states. [2019-12-07 12:42:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:36,640 INFO L93 Difference]: Finished difference Result 5731 states and 7565 transitions. [2019-12-07 12:42:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:36,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-12-07 12:42:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:36,655 INFO L225 Difference]: With dead ends: 5731 [2019-12-07 12:42:36,655 INFO L226 Difference]: Without dead ends: 3030 [2019-12-07 12:42:36,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 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-12-07 12:42:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-12-07 12:42:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2019-12-07 12:42:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 12:42:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3227 transitions. [2019-12-07 12:42:36,713 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3227 transitions. Word has length 309 [2019-12-07 12:42:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:36,714 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3227 transitions. [2019-12-07 12:42:36,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3227 transitions. [2019-12-07 12:42:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-12-07 12:42:36,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:36,721 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:36,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:36,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash -369817949, now seen corresponding path program 1 times [2019-12-07 12:42:36,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:36,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068918350] [2019-12-07 12:42:36,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 337 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 12:42:37,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068918350] [2019-12-07 12:42:37,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81326179] [2019-12-07 12:42:37,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:37,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:42:37,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:37,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 318 proven. 23 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 12:42:37,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:37,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 12:42:37,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058994286] [2019-12-07 12:42:37,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:42:37,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:42:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:42:37,693 INFO L87 Difference]: Start difference. First operand 2852 states and 3227 transitions. Second operand 8 states. [2019-12-07 12:42:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:38,930 INFO L93 Difference]: Finished difference Result 5744 states and 6499 transitions. [2019-12-07 12:42:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:42:38,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 356 [2019-12-07 12:42:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:38,940 INFO L225 Difference]: With dead ends: 5744 [2019-12-07 12:42:38,940 INFO L226 Difference]: Without dead ends: 3072 [2019-12-07 12:42:38,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:42:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-07 12:42:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2852. [2019-12-07 12:42:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 12:42:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3222 transitions. [2019-12-07 12:42:38,977 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3222 transitions. Word has length 356 [2019-12-07 12:42:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:38,977 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3222 transitions. [2019-12-07 12:42:38,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:42:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3222 transitions. [2019-12-07 12:42:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-12-07 12:42:38,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:38,987 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:39,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:39,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1129963505, now seen corresponding path program 1 times [2019-12-07 12:42:39,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:39,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672936280] [2019-12-07 12:42:39,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 12:42:40,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672936280] [2019-12-07 12:42:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:42:40,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859396465] [2019-12-07 12:42:40,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:42:40,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:42:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:42:40,035 INFO L87 Difference]: Start difference. First operand 2852 states and 3222 transitions. Second operand 8 states. [2019-12-07 12:42:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:40,932 INFO L93 Difference]: Finished difference Result 5530 states and 6269 transitions. [2019-12-07 12:42:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:42:40,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 574 [2019-12-07 12:42:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:40,941 INFO L225 Difference]: With dead ends: 5530 [2019-12-07 12:42:40,941 INFO L226 Difference]: Without dead ends: 2858 [2019-12-07 12:42:40,943 INFO L630 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-12-07 12:42:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-12-07 12:42:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2852. [2019-12-07 12:42:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 12:42:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3214 transitions. [2019-12-07 12:42:40,972 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3214 transitions. Word has length 574 [2019-12-07 12:42:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:40,973 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3214 transitions. [2019-12-07 12:42:40,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:42:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3214 transitions. [2019-12-07 12:42:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-12-07 12:42:40,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:40,977 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:40,977 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1958858224, now seen corresponding path program 1 times [2019-12-07 12:42:40,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:40,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232342949] [2019-12-07 12:42:40,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 578 proven. 260 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-12-07 12:42:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232342949] [2019-12-07 12:42:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742387204] [2019-12-07 12:42:41,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:41,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:41,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-12-07 12:42:42,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:42,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 12:42:42,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712783299] [2019-12-07 12:42:42,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:42,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:42,094 INFO L87 Difference]: Start difference. First operand 2852 states and 3214 transitions. Second operand 4 states. [2019-12-07 12:42:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:42,665 INFO L93 Difference]: Finished difference Result 7304 states and 8336 transitions. [2019-12-07 12:42:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:42,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-12-07 12:42:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:42,679 INFO L225 Difference]: With dead ends: 7304 [2019-12-07 12:42:42,679 INFO L226 Difference]: Without dead ends: 4632 [2019-12-07 12:42:42,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 598 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-12-07 12:42:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2019-12-07 12:42:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 12:42:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5055 transitions. [2019-12-07 12:42:42,724 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5055 transitions. Word has length 600 [2019-12-07 12:42:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:42,725 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 5055 transitions. [2019-12-07 12:42:42,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5055 transitions. [2019-12-07 12:42:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-12-07 12:42:42,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:42,729 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:42,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:42,931 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1310836641, now seen corresponding path program 1 times [2019-12-07 12:42:42,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:42,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863085675] [2019-12-07 12:42:42,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-12-07 12:42:43,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863085675] [2019-12-07 12:42:43,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648415758] [2019-12-07 12:42:43,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:43,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:43,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-12-07 12:42:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:42:43,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-12-07 12:42:43,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234989707] [2019-12-07 12:42:43,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:42:43,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:42:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:43,668 INFO L87 Difference]: Start difference. First operand 4632 states and 5055 transitions. Second operand 5 states. [2019-12-07 12:42:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:44,431 INFO L93 Difference]: Finished difference Result 11398 states and 12490 transitions. [2019-12-07 12:42:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:44,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 641 [2019-12-07 12:42:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:44,455 INFO L225 Difference]: With dead ends: 11398 [2019-12-07 12:42:44,455 INFO L226 Difference]: Without dead ends: 6946 [2019-12-07 12:42:44,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-12-07 12:42:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5878. [2019-12-07 12:42:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-12-07 12:42:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6406 transitions. [2019-12-07 12:42:44,513 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6406 transitions. Word has length 641 [2019-12-07 12:42:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:44,513 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6406 transitions. [2019-12-07 12:42:44,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:42:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6406 transitions. [2019-12-07 12:42:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-12-07 12:42:44,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:44,518 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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] [2019-12-07 12:42:44,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:44,719 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1502121497, now seen corresponding path program 1 times [2019-12-07 12:42:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:44,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144392511] [2019-12-07 12:42:44,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1095 proven. 260 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-12-07 12:42:45,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144392511] [2019-12-07 12:42:45,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602400790] [2019-12-07 12:42:45,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:45,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:45,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-12-07 12:42:46,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:46,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 12:42:46,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378726220] [2019-12-07 12:42:46,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:46,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:42:46,077 INFO L87 Difference]: Start difference. First operand 5878 states and 6406 transitions. Second operand 3 states. [2019-12-07 12:42:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:46,422 INFO L93 Difference]: Finished difference Result 11754 states and 12811 transitions. [2019-12-07 12:42:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:46,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 651 [2019-12-07 12:42:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:46,435 INFO L225 Difference]: With dead ends: 11754 [2019-12-07 12:42:46,435 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 12:42:46,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:42:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 12:42:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2019-12-07 12:42:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 12:42:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6162 transitions. [2019-12-07 12:42:46,481 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6162 transitions. Word has length 651 [2019-12-07 12:42:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:46,481 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6162 transitions. [2019-12-07 12:42:46,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6162 transitions. [2019-12-07 12:42:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-12-07 12:42:46,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:46,485 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:46,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:46,687 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1331694009, now seen corresponding path program 1 times [2019-12-07 12:42:46,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027360201] [2019-12-07 12:42:46,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 708 proven. 325 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-12-07 12:42:47,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027360201] [2019-12-07 12:42:47,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780634926] [2019-12-07 12:42:47,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:47,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:42:47,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 12:42:48,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:48,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 12:42:48,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966348630] [2019-12-07 12:42:48,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:48,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:48,143 INFO L87 Difference]: Start difference. First operand 5700 states and 6162 transitions. Second operand 4 states. [2019-12-07 12:42:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:48,628 INFO L93 Difference]: Finished difference Result 11398 states and 12323 transitions. [2019-12-07 12:42:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:48,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 695 [2019-12-07 12:42:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:48,634 INFO L225 Difference]: With dead ends: 11398 [2019-12-07 12:42:48,634 INFO L226 Difference]: Without dead ends: 5878 [2019-12-07 12:42:48,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 693 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-12-07 12:42:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-12-07 12:42:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 12:42:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5956 transitions. [2019-12-07 12:42:48,683 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5956 transitions. Word has length 695 [2019-12-07 12:42:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:48,683 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5956 transitions. [2019-12-07 12:42:48,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5956 transitions. [2019-12-07 12:42:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-12-07 12:42:48,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:48,688 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 12:42:48,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:48,889 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1867062169, now seen corresponding path program 1 times [2019-12-07 12:42:48,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:48,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984604355] [2019-12-07 12:42:48,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-12-07 12:42:49,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984604355] [2019-12-07 12:42:49,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:49,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:42:49,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336797934] [2019-12-07 12:42:49,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:49,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:49,369 INFO L87 Difference]: Start difference. First operand 5522 states and 5956 transitions. Second operand 4 states. [2019-12-07 12:42:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:49,954 INFO L93 Difference]: Finished difference Result 11754 states and 12725 transitions. [2019-12-07 12:42:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:49,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 758 [2019-12-07 12:42:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:49,961 INFO L225 Difference]: With dead ends: 11754 [2019-12-07 12:42:49,961 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 12:42:49,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 12:42:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5344. [2019-12-07 12:42:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-12-07 12:42:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5708 transitions. [2019-12-07 12:42:50,009 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5708 transitions. Word has length 758 [2019-12-07 12:42:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:50,010 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5708 transitions. [2019-12-07 12:42:50,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5708 transitions. [2019-12-07 12:42:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-12-07 12:42:50,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:50,017 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:50,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash -540711606, now seen corresponding path program 1 times [2019-12-07 12:42:50,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:50,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761398943] [2019-12-07 12:42:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 1215 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 12:42:50,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761398943] [2019-12-07 12:42:50,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646259060] [2019-12-07 12:42:50,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:50,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:42:50,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:50,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:50,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-12-07 12:42:51,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:51,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-12-07 12:42:51,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588994155] [2019-12-07 12:42:51,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:51,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:42:51,384 INFO L87 Difference]: Start difference. First operand 5344 states and 5708 transitions. Second operand 4 states. [2019-12-07 12:42:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:52,361 INFO L93 Difference]: Finished difference Result 11932 states and 12761 transitions. [2019-12-07 12:42:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:52,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 808 [2019-12-07 12:42:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:52,366 INFO L225 Difference]: With dead ends: 11932 [2019-12-07 12:42:52,366 INFO L226 Difference]: Without dead ends: 6768 [2019-12-07 12:42:52,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:42:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-12-07 12:42:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6056. [2019-12-07 12:42:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 12:42:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6465 transitions. [2019-12-07 12:42:52,415 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6465 transitions. Word has length 808 [2019-12-07 12:42:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,415 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6465 transitions. [2019-12-07 12:42:52,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6465 transitions. [2019-12-07 12:42:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-12-07 12:42:52,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,421 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 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, 1] [2019-12-07 12:42:52,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:52,622 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash -172725225, now seen corresponding path program 1 times [2019-12-07 12:42:52,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:52,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250786934] [2019-12-07 12:42:52,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 632 proven. 619 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-12-07 12:42:53,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250786934] [2019-12-07 12:42:53,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994892971] [2019-12-07 12:42:53,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:53,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:42:53,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-12-07 12:42:53,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:53,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-12-07 12:42:53,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746322563] [2019-12-07 12:42:53,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:53,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:53,895 INFO L87 Difference]: Start difference. First operand 6056 states and 6465 transitions. Second operand 3 states. [2019-12-07 12:42:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:54,268 INFO L93 Difference]: Finished difference Result 12288 states and 13155 transitions. [2019-12-07 12:42:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:54,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 810 [2019-12-07 12:42:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:54,272 INFO L225 Difference]: With dead ends: 12288 [2019-12-07 12:42:54,272 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 12:42:54,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 811 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:42:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 12:42:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5700. [2019-12-07 12:42:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 12:42:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-12-07 12:42:54,317 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 810 [2019-12-07 12:42:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:54,317 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-12-07 12:42:54,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-12-07 12:42:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-12-07 12:42:54,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:54,322 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:54,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:54,523 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2108387026, now seen corresponding path program 1 times [2019-12-07 12:42:54,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:54,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428234513] [2019-12-07 12:42:54,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 1251 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 12:42:55,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428234513] [2019-12-07 12:42:55,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542985868] [2019-12-07 12:42:55,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:55,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:42:55,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:55,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:55,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-12-07 12:42:56,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:42:56,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-12-07 12:42:56,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718302291] [2019-12-07 12:42:56,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:56,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:42:56,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:42:56,089 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 4 states. [2019-12-07 12:42:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:57,996 INFO L93 Difference]: Finished difference Result 12466 states and 13239 transitions. [2019-12-07 12:42:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:42:57,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 841 [2019-12-07 12:42:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:58,002 INFO L225 Difference]: With dead ends: 12466 [2019-12-07 12:42:58,002 INFO L226 Difference]: Without dead ends: 6946 [2019-12-07 12:42:58,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 840 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:42:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-12-07 12:42:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5700. [2019-12-07 12:42:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 12:42:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-12-07 12:42:58,061 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 841 [2019-12-07 12:42:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:58,062 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-12-07 12:42:58,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-12-07 12:42:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-12-07 12:42:58,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:58,071 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:58,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:58,272 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1692043947, now seen corresponding path program 1 times [2019-12-07 12:42:58,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:42:58,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359009336] [2019-12-07 12:42:58,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1252 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 12:42:58,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359009336] [2019-12-07 12:42:58,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997913284] [2019-12-07 12:42:58,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:42:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:42:58,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:42:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:42:59,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:01,498 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 102 DAG size of output: 36 [2019-12-07 12:43:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1340 proven. 537 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-12-07 12:43:02,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:43:02,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 12:43:02,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482782833] [2019-12-07 12:43:02,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:43:02,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:43:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:43:02,349 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 8 states. [2019-12-07 12:43:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:14,791 INFO L93 Difference]: Finished difference Result 14602 states and 15496 transitions. [2019-12-07 12:43:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:43:14,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 842 [2019-12-07 12:43:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:14,796 INFO L225 Difference]: With dead ends: 14602 [2019-12-07 12:43:14,797 INFO L226 Difference]: Without dead ends: 9082 [2019-12-07 12:43:14,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 841 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:43:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2019-12-07 12:43:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 6768. [2019-12-07 12:43:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6768 states. [2019-12-07 12:43:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 7166 transitions. [2019-12-07 12:43:14,856 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 7166 transitions. Word has length 842 [2019-12-07 12:43:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:14,856 INFO L462 AbstractCegarLoop]: Abstraction has 6768 states and 7166 transitions. [2019-12-07 12:43:14,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:43:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 7166 transitions. [2019-12-07 12:43:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2019-12-07 12:43:14,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:14,863 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:15,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:15,064 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2126525007, now seen corresponding path program 1 times [2019-12-07 12:43:15,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:15,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821720363] [2019-12-07 12:43:15,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 219 proven. 1067 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-12-07 12:43:16,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821720363] [2019-12-07 12:43:16,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138375709] [2019-12-07 12:43:16,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:16,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:43:16,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,465 WARN L192 SmtUtils]: Spent 7.33 s on a formula simplification. DAG size of input: 131 DAG size of output: 29 [2019-12-07 12:43:24,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:24,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 629 proven. 769 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-12-07 12:43:26,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:43:26,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-12-07 12:43:26,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258598301] [2019-12-07 12:43:26,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 12:43:26,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 12:43:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:43:26,842 INFO L87 Difference]: Start difference. First operand 6768 states and 7166 transitions. Second operand 16 states. [2019-12-07 12:43:27,675 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 12:43:28,047 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 12:45:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:22,354 INFO L93 Difference]: Finished difference Result 17148 states and 18209 transitions. [2019-12-07 12:45:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 12:45:22,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 927 [2019-12-07 12:45:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:22,361 INFO L225 Difference]: With dead ends: 17148 [2019-12-07 12:45:22,361 INFO L226 Difference]: Without dead ends: 10560 [2019-12-07 12:45:22,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 921 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:45:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2019-12-07 12:45:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 7480. [2019-12-07 12:45:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2019-12-07 12:45:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 7971 transitions. [2019-12-07 12:45:22,428 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 7971 transitions. Word has length 927 [2019-12-07 12:45:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:22,429 INFO L462 AbstractCegarLoop]: Abstraction has 7480 states and 7971 transitions. [2019-12-07 12:45:22,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 12:45:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 7971 transitions. [2019-12-07 12:45:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1035 [2019-12-07 12:45:22,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:22,437 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:22,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:45:22,638 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1713888931, now seen corresponding path program 1 times [2019-12-07 12:45:22,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:22,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214582258] [2019-12-07 12:45:22,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3787 backedges. 1197 proven. 0 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-12-07 12:45:23,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214582258] [2019-12-07 12:45:23,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:45:23,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:45:23,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488746653] [2019-12-07 12:45:23,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:45:23,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:23,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:45:23,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:45:23,488 INFO L87 Difference]: Start difference. First operand 7480 states and 7971 transitions. Second operand 6 states. [2019-12-07 12:45:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:23,968 INFO L93 Difference]: Finished difference Result 14824 states and 15792 transitions. [2019-12-07 12:45:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:45:23,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1034 [2019-12-07 12:45:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:23,972 INFO L225 Difference]: With dead ends: 14824 [2019-12-07 12:45:23,972 INFO L226 Difference]: Without dead ends: 7302 [2019-12-07 12:45:23,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:45:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-12-07 12:45:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7124. [2019-12-07 12:45:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7124 states. [2019-12-07 12:45:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 7589 transitions. [2019-12-07 12:45:24,026 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 7589 transitions. Word has length 1034 [2019-12-07 12:45:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:24,027 INFO L462 AbstractCegarLoop]: Abstraction has 7124 states and 7589 transitions. [2019-12-07 12:45:24,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:45:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 7589 transitions. [2019-12-07 12:45:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2019-12-07 12:45:24,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:24,036 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:24,036 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash 643265044, now seen corresponding path program 1 times [2019-12-07 12:45:24,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686249059] [2019-12-07 12:45:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3829 backedges. 1839 proven. 0 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-12-07 12:45:25,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686249059] [2019-12-07 12:45:25,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:45:25,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:45:25,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614796598] [2019-12-07 12:45:25,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:45:25,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:45:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:45:25,059 INFO L87 Difference]: Start difference. First operand 7124 states and 7589 transitions. Second operand 7 states. [2019-12-07 12:45:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:25,620 INFO L93 Difference]: Finished difference Result 14346 states and 15273 transitions. [2019-12-07 12:45:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:45:25,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1041 [2019-12-07 12:45:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:25,625 INFO L225 Difference]: With dead ends: 14346 [2019-12-07 12:45:25,625 INFO L226 Difference]: Without dead ends: 7174 [2019-12-07 12:45:25,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:45:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-12-07 12:45:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6996. [2019-12-07 12:45:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-12-07 12:45:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7405 transitions. [2019-12-07 12:45:25,677 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7405 transitions. Word has length 1041 [2019-12-07 12:45:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:25,678 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7405 transitions. [2019-12-07 12:45:25,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:45:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7405 transitions. [2019-12-07 12:45:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2019-12-07 12:45:25,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:25,686 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:25,686 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1886227147, now seen corresponding path program 1 times [2019-12-07 12:45:25,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:25,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028893978] [2019-12-07 12:45:25,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 27 proven. 854 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-12-07 12:45:26,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028893978] [2019-12-07 12:45:26,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937101281] [2019-12-07 12:45:26,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:45:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:27,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:45:27,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:45:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:45:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 482 proven. 399 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-12-07 12:45:28,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:45:28,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-12-07 12:45:28,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671731701] [2019-12-07 12:45:28,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:45:28,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:28,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:45:28,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:45:28,372 INFO L87 Difference]: Start difference. First operand 6996 states and 7405 transitions. Second operand 10 states. [2019-12-07 12:45:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:32,753 INFO L93 Difference]: Finished difference Result 17344 states and 18387 transitions. [2019-12-07 12:45:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 12:45:32,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1056 [2019-12-07 12:45:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:32,759 INFO L225 Difference]: With dead ends: 17344 [2019-12-07 12:45:32,759 INFO L226 Difference]: Without dead ends: 10022 [2019-12-07 12:45:32,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1053 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:45:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2019-12-07 12:45:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 6996. [2019-12-07 12:45:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-12-07 12:45:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7374 transitions. [2019-12-07 12:45:32,827 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7374 transitions. Word has length 1056 [2019-12-07 12:45:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7374 transitions. [2019-12-07 12:45:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:45:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7374 transitions. [2019-12-07 12:45:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2108 [2019-12-07 12:45:32,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:32,853 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:33,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:45:33,054 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1766247281, now seen corresponding path program 1 times [2019-12-07 12:45:33,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:33,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133332246] [2019-12-07 12:45:33,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14410 backedges. 3163 proven. 0 refuted. 0 times theorem prover too weak. 11247 trivial. 0 not checked. [2019-12-07 12:45:35,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133332246] [2019-12-07 12:45:35,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:45:35,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:45:35,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961579809] [2019-12-07 12:45:35,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:45:35,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:45:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:45:35,672 INFO L87 Difference]: Start difference. First operand 6996 states and 7374 transitions. Second operand 7 states. [2019-12-07 12:45:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:36,127 INFO L93 Difference]: Finished difference Result 13822 states and 14550 transitions. [2019-12-07 12:45:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:45:36,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2107 [2019-12-07 12:45:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:36,132 INFO L225 Difference]: With dead ends: 13822 [2019-12-07 12:45:36,132 INFO L226 Difference]: Without dead ends: 6640 [2019-12-07 12:45:36,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:45:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2019-12-07 12:45:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6640. [2019-12-07 12:45:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6640 states. [2019-12-07 12:45:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 6970 transitions. [2019-12-07 12:45:36,183 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 6970 transitions. Word has length 2107 [2019-12-07 12:45:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:36,184 INFO L462 AbstractCegarLoop]: Abstraction has 6640 states and 6970 transitions. [2019-12-07 12:45:36,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:45:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 6970 transitions. [2019-12-07 12:45:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2142 [2019-12-07 12:45:36,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:36,209 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:36,209 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1393034536, now seen corresponding path program 1 times [2019-12-07 12:45:36,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:36,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543259943] [2019-12-07 12:45:36,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14857 backedges. 3538 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-12-07 12:45:38,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543259943] [2019-12-07 12:45:38,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:45:38,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:45:38,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994660210] [2019-12-07 12:45:38,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:45:38,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:45:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:45:38,657 INFO L87 Difference]: Start difference. First operand 6640 states and 6970 transitions. Second operand 4 states. [2019-12-07 12:45:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:39,164 INFO L93 Difference]: Finished difference Result 14524 states and 15183 transitions. [2019-12-07 12:45:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:45:39,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2141 [2019-12-07 12:45:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:39,168 INFO L225 Difference]: With dead ends: 14524 [2019-12-07 12:45:39,169 INFO L226 Difference]: Without dead ends: 5216 [2019-12-07 12:45:39,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:45:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-12-07 12:45:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5216. [2019-12-07 12:45:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-12-07 12:45:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 5322 transitions. [2019-12-07 12:45:39,212 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 5322 transitions. Word has length 2141 [2019-12-07 12:45:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:39,213 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 5322 transitions. [2019-12-07 12:45:39,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:45:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 5322 transitions. [2019-12-07 12:45:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2202 [2019-12-07 12:45:39,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:45:39,242 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:45:39,242 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:45:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:45:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1047725754, now seen corresponding path program 1 times [2019-12-07 12:45:39,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:45:39,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156578948] [2019-12-07 12:45:39,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:45:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3815 proven. 38 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 12:45:43,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156578948] [2019-12-07 12:45:43,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365579012] [2019-12-07 12:45:43,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:45:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:45:43,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:45:43,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:45:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3787 proven. 66 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 12:45:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:45:46,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 12:45:46,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576282157] [2019-12-07 12:45:46,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:45:46,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:45:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:45:46,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:45:46,482 INFO L87 Difference]: Start difference. First operand 5216 states and 5322 transitions. Second operand 12 states. [2019-12-07 12:45:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:45:50,216 INFO L93 Difference]: Finished difference Result 10015 states and 10226 transitions. [2019-12-07 12:45:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:45:50,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2201 [2019-12-07 12:45:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:45:50,218 INFO L225 Difference]: With dead ends: 10015 [2019-12-07 12:45:50,218 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:45:50,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2222 GetRequests, 2205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:45:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:45:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:45:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:45:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:45:50,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2201 [2019-12-07 12:45:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:45:50,222 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:45:50,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:45:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:45:50,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:45:50,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:45:50,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:45:50,902 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 409 [2019-12-07 12:45:51,262 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 409 [2019-12-07 12:45:55,007 WARN L192 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 392 DAG size of output: 99 [2019-12-07 12:45:58,805 WARN L192 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 392 DAG size of output: 99 [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 12:45:58,809 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 12:45:58,810 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 12:45:58,811 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,812 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 12:45:58,813 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 12:45:58,814 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 12:45:58,815 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 12:45:58,816 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,817 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,818 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8)) (.cse10 (not (= ~a15~0 5))) (.cse17 (+ ~a12~0 43))) (let ((.cse2 (= ~a15~0 9)) (.cse12 (< 80 ~a12~0)) (.cse6 (let ((.cse18 (<= .cse17 0))) (or (and .cse18 .cse10) (and (not (= ~a21~0 9)) .cse18) (<= (+ ~a12~0 49) 0)))) (.cse8 (= ~a21~0 8)) (.cse15 (<= (+ ~a12~0 45156) 0)) (.cse1 (= ~a21~0 10)) (.cse14 (= ~a21~0 7)) (.cse13 (= ~a21~0 6)) (.cse3 (<= ~a12~0 11)) (.cse9 (< 0 .cse17)) (.cse11 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse0 (= ~a24~0 1)) (.cse16 (not .cse7)) (.cse4 (<= ~a15~0 8)) (.cse5 (<= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse3)) .cse0) (and (= ~a15~0 7) .cse0 .cse1) (and (<= ~a12~0 75) .cse0 .cse8 .cse2) (and (or (and .cse1 .cse4 (<= ~a12~0 73281) .cse9) (and .cse10 .cse11 .cse1 .cse4 .cse9)) .cse0) (and .cse0 .cse2 .cse12) (and .cse13 .cse11 .cse0 .cse12 .cse4) (and (<= ~a12~0 80) (not .cse13) .cse0 .cse4 .cse5 .cse9 (not .cse14)) (and .cse15 .cse16 .cse4 (<= ~a21~0 6) .cse5 .cse6) (and .cse0 .cse14 .cse3 .cse4) (and .cse10 .cse11 .cse0 .cse8 .cse4) (and .cse10 .cse0 .cse8 .cse16 .cse4) (and .cse10 .cse15 .cse0 .cse1 .cse4) (and .cse0 .cse14 .cse16 .cse4) (and .cse13 .cse10 .cse0 .cse16 .cse4) (and .cse10 .cse0 .cse16 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse16 .cse4 .cse5)))) [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,819 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:45:58,820 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8)) (.cse10 (not (= ~a15~0 5))) (.cse17 (+ ~a12~0 43))) (let ((.cse2 (= ~a15~0 9)) (.cse12 (< 80 ~a12~0)) (.cse6 (let ((.cse18 (<= .cse17 0))) (or (and .cse18 .cse10) (and (not (= ~a21~0 9)) .cse18) (<= (+ ~a12~0 49) 0)))) (.cse8 (= ~a21~0 8)) (.cse15 (<= (+ ~a12~0 45156) 0)) (.cse1 (= ~a21~0 10)) (.cse14 (= ~a21~0 7)) (.cse13 (= ~a21~0 6)) (.cse3 (<= ~a12~0 11)) (.cse9 (< 0 .cse17)) (.cse11 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse0 (= ~a24~0 1)) (.cse16 (not .cse7)) (.cse4 (<= ~a15~0 8)) (.cse5 (<= ~a21~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse3)) .cse0) (and (= ~a15~0 7) .cse0 .cse1) (and (<= ~a12~0 75) .cse0 .cse8 .cse2) (and (or (and .cse1 .cse4 (<= ~a12~0 73281) .cse9) (and .cse10 .cse11 .cse1 .cse4 .cse9)) .cse0) (and .cse0 .cse2 .cse12) (and .cse13 .cse11 .cse0 .cse12 .cse4) (and (<= ~a12~0 80) (not .cse13) .cse0 .cse4 .cse5 .cse9 (not .cse14)) (and .cse15 .cse16 .cse4 (<= ~a21~0 6) .cse5 .cse6) (and .cse0 .cse14 .cse3 .cse4) (and .cse10 .cse11 .cse0 .cse8 .cse4) (and .cse10 .cse0 .cse8 .cse16 .cse4) (and .cse10 .cse15 .cse0 .cse1 .cse4) (and .cse0 .cse14 .cse16 .cse4) (and .cse13 .cse10 .cse0 .cse16 .cse4) (and .cse10 .cse0 .cse16 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse16 .cse4 .cse5)))) [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 12:45:58,821 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,822 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 12:45:58,823 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 12:45:58,824 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 12:45:58,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:45:58 BoogieIcfgContainer [2019-12-07 12:45:58,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:45:58,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:45:58,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:45:58,856 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:45:58,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:31" (3/4) ... [2019-12-07 12:45:58,859 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:45:58,877 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:45:58,878 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:45:58,897 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || ((((a15 <= 8 && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0)) || ((a15 == 8 && a21 == 10) && a12 <= 11)) && a24 == 1)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a21 == 10) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((((a21 == 6 && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && 80 < a12) && a15 <= 8)) || ((((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && a21 <= 9) && 0 < a12 + 43) && !(a21 == 7))) || (((((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6) && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0))) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((!(a15 == 5) && a12 + 45156 <= 0) && a24 == 1) && a21 == 10) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 <= 9) [2019-12-07 12:45:58,899 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || ((((a15 <= 8 && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0)) || ((a15 == 8 && a21 == 10) && a12 <= 11)) && a24 == 1)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a21 == 10) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((((a21 == 6 && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && 80 < a12) && a15 <= 8)) || ((((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && a21 <= 9) && 0 < a12 + 43) && !(a21 == 7))) || (((((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6) && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0))) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((!(a15 == 5) && a12 + 45156 <= 0) && a24 == 1) && a21 == 10) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 <= 9) [2019-12-07 12:45:58,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8fd5d4a9-a40e-45d3-82f1-4822a68cd940/bin/uautomizer/witness.graphml [2019-12-07 12:45:58,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:45:58,955 INFO L168 Benchmark]: Toolchain (without parser) took 209111.27 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 932.6 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 555.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,955 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:45:58,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,956 INFO L168 Benchmark]: Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,956 INFO L168 Benchmark]: RCFGBuilder took 853.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 904.1 MB in the end (delta: 135.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,956 INFO L168 Benchmark]: TraceAbstraction took 207638.05 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 904.1 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,957 INFO L168 Benchmark]: Witness Printer took 98.05 ms. Allocated memory is still 3.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:45:58,958 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 403.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 853.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 904.1 MB in the end (delta: 135.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 207638.05 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 904.1 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 98.05 ms. Allocated memory is still 3.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 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_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: 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-12-07 12:45:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || ((((a15 <= 8 && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0)) || ((a15 == 8 && a21 == 10) && a12 <= 11)) && a24 == 1)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a21 == 10) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((((a21 == 6 && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && 80 < a12) && a15 <= 8)) || ((((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && a21 <= 9) && 0 < a12 + 43) && !(a21 == 7))) || (((((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6) && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0))) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((!(a15 == 5) && a12 + 45156 <= 0) && a24 == 1) && a21 == 10) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 <= 9) - InvariantResult [Line: 20]: Loop Invariant [2019-12-07 12:45:58,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-12-07 12:45:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || ((((a15 <= 8 && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0)) || ((a15 == 8 && a21 == 10) && a12 <= 11)) && a24 == 1)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a21 == 10) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((((a21 == 6 && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && 80 < a12) && a15 <= 8)) || ((((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && a21 <= 9) && 0 < a12 + 43) && !(a21 == 7))) || (((((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6) && a21 <= 9) && (((a12 + 43 <= 0 && !(a15 == 5)) || (!(a21 == 9) && a12 + 43 <= 0)) || a12 + 49 <= 0))) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((!(a15 == 5) && a12 + 45156 <= 0) && a24 == 1) && a21 == 10) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((!(a15 == 5) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 <= 9) - 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: 199.1s, OverallIterations: 23, TraceHistogramMax: 18, AutomataDifference: 150.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.3s, HoareTripleCheckerStatistics: 1608 SDtfs, 16077 SDslu, 439 SDs, 0 SdLazy, 32229 SolverSat, 3129 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 142.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11213 GetRequests, 11014 SyntacticMatches, 22 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7480occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 16122 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 126 NumberOfFragments, 825 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1000882 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 420572 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 29972 NumberOfCodeBlocks, 29972 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 29935 ConstructedInterpolants, 441 QuantifiedInterpolants, 99999462 SizeOfPredicates, 20 NumberOfNonLiveVariables, 13573 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 107109/112774 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...