./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label53.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_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label53.c -s /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 197209881b4fe70c7fe468e7084aa1de2f7c6240 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:20:24,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:20:24,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:20:24,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:20:24,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:20:24,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:20:24,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:20:24,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:20:24,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:20:24,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:20:24,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:20:24,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:20:24,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:20:24,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:20:24,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:20:24,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:20:24,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:20:24,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:20:24,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:20:24,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:20:24,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:20:24,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:20:24,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:20:24,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:20:24,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:20:24,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:20:24,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:20:24,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:20:24,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:20:24,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:20:24,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:20:24,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:20:24,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:20:24,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:20:24,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:20:24,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:20:24,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:20:24,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:20:24,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:20:24,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:20:24,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:20:24,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:20:24,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:20:24,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:20:24,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:20:24,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:20:24,431 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:20:24,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:20:24,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:20:24,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:20:24,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:20:24,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:20:24,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:20:24,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:20:24,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:20:24,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:20:24,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:20:24,434 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_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 -> 197209881b4fe70c7fe468e7084aa1de2f7c6240 [2019-12-07 16:20:24,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:20:24,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:20:24,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:20:24,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:20:24,552 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:20:24,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2019-12-07 16:20:24,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/data/eb2f847cf/d66f7a4a1b614ab9bcbafe1371911ccd/FLAGfdd46eef7 [2019-12-07 16:20:25,100 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:20:25,101 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2019-12-07 16:20:25,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/data/eb2f847cf/d66f7a4a1b614ab9bcbafe1371911ccd/FLAGfdd46eef7 [2019-12-07 16:20:25,625 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/data/eb2f847cf/d66f7a4a1b614ab9bcbafe1371911ccd [2019-12-07 16:20:25,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:20:25,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:20:25,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:25,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:20:25,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:20:25,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:25" (1/1) ... [2019-12-07 16:20:25,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2c5fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:25, skipping insertion in model container [2019-12-07 16:20:25,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:25" (1/1) ... [2019-12-07 16:20:25,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:20:25,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:20:25,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:25,933 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:20:26,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:26,011 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:20:26,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26 WrapperNode [2019-12-07 16:20:26,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:26,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:26,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:20:26,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:20:26,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:26,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:20:26,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:20:26,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:20:26,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... [2019-12-07 16:20:26,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:20:26,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:20:26,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:20:26,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:20:26,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:20:26,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:20:26,960 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:20:26,960 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:20:26,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:26 BoogieIcfgContainer [2019-12-07 16:20:26,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:20:26,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:20:26,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:20:26,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:20:26,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:20:25" (1/3) ... [2019-12-07 16:20:26,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3820b898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:26, skipping insertion in model container [2019-12-07 16:20:26,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:26" (2/3) ... [2019-12-07 16:20:26,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3820b898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:26, skipping insertion in model container [2019-12-07 16:20:26,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:26" (3/3) ... [2019-12-07 16:20:26,967 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2019-12-07 16:20:26,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:20:26,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:20:26,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:20:27,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:20:27,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:20:27,005 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:20:27,005 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:20:27,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:20:27,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:20:27,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:20:27,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:20:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 16:20:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 16:20:27,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:27,027 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] [2019-12-07 16:20:27,028 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2019-12-07 16:20:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:27,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930509363] [2019-12-07 16:20:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:27,278 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 16:20:27,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930509363] [2019-12-07 16:20:27,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:27,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:20:27,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777555320] [2019-12-07 16:20:27,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:20:27,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:27,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:20:27,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:20:27,295 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-12-07 16:20:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:28,470 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-12-07 16:20:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:20:28,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 16:20:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:28,484 INFO L225 Difference]: With dead ends: 852 [2019-12-07 16:20:28,484 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 16:20:28,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:20:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 16:20:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 16:20:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 16:20:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-12-07 16:20:28,538 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2019-12-07 16:20:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:28,538 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-12-07 16:20:28,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:20:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-12-07 16:20:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 16:20:28,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:28,545 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 16:20:28,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2019-12-07 16:20:28,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:28,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691598040] [2019-12-07 16:20:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 16:20:28,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691598040] [2019-12-07 16:20:28,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:28,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:20:28,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019184625] [2019-12-07 16:20:28,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:28,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:28,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:28,701 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-12-07 16:20:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:29,446 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-12-07 16:20:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:29,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-12-07 16:20:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:29,450 INFO L225 Difference]: With dead ends: 1252 [2019-12-07 16:20:29,450 INFO L226 Difference]: Without dead ends: 894 [2019-12-07 16:20:29,452 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 16:20:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-07 16:20:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-12-07 16:20:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 16:20:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-12-07 16:20:29,469 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 197 [2019-12-07 16:20:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:29,469 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-12-07 16:20:29,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-12-07 16:20:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 16:20:29,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:29,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:29,472 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2019-12-07 16:20:29,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:29,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148507936] [2019-12-07 16:20:29,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 150 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 16:20:29,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148507936] [2019-12-07 16:20:29,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445004632] [2019-12-07 16:20:29,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:29,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:20:29,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 16:20:29,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:20:29,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 16:20:29,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029681187] [2019-12-07 16:20:29,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:29,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:29,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:20:29,818 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 4 states. [2019-12-07 16:20:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:30,406 INFO L93 Difference]: Finished difference Result 1815 states and 2499 transitions. [2019-12-07 16:20:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:30,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-12-07 16:20:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:30,411 INFO L225 Difference]: With dead ends: 1815 [2019-12-07 16:20:30,411 INFO L226 Difference]: Without dead ends: 1072 [2019-12-07 16:20:30,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 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 16:20:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-12-07 16:20:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2019-12-07 16:20:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 16:20:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1018 transitions. [2019-12-07 16:20:30,427 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1018 transitions. Word has length 220 [2019-12-07 16:20:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:30,427 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1018 transitions. [2019-12-07 16:20:30,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1018 transitions. [2019-12-07 16:20:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-12-07 16:20:30,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:30,431 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 16:20:30,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:30,631 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1442108356, now seen corresponding path program 1 times [2019-12-07 16:20:30,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:30,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710335278] [2019-12-07 16:20:30,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 255 proven. 65 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 16:20:31,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710335278] [2019-12-07 16:20:31,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152642] [2019-12-07 16:20:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:31,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:20:31,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-12-07 16:20:31,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:20:31,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:20:31,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385304372] [2019-12-07 16:20:31,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:20:31,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:20:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:31,154 INFO L87 Difference]: Start difference. First operand 894 states and 1018 transitions. Second operand 3 states. [2019-12-07 16:20:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:31,544 INFO L93 Difference]: Finished difference Result 2320 states and 2691 transitions. [2019-12-07 16:20:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:20:31,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-12-07 16:20:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:31,550 INFO L225 Difference]: With dead ends: 2320 [2019-12-07 16:20:31,550 INFO L226 Difference]: Without dead ends: 1606 [2019-12-07 16:20:31,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-07 16:20:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-12-07 16:20:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 16:20:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1598 transitions. [2019-12-07 16:20:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1598 transitions. Word has length 315 [2019-12-07 16:20:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:31,571 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1598 transitions. [2019-12-07 16:20:31,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:20:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1598 transitions. [2019-12-07 16:20:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-12-07 16:20:31,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:31,577 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:31,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:31,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1954253435, now seen corresponding path program 1 times [2019-12-07 16:20:31,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:31,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425260616] [2019-12-07 16:20:31,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 16:20:31,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425260616] [2019-12-07 16:20:31,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323315795] [2019-12-07 16:20:31,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:32,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:20:32,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 16:20:32,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:20:32,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-12-07 16:20:32,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172066428] [2019-12-07 16:20:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:20:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:20:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:20:32,226 INFO L87 Difference]: Start difference. First operand 1428 states and 1598 transitions. Second operand 3 states. [2019-12-07 16:20:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:32,595 INFO L93 Difference]: Finished difference Result 3388 states and 3839 transitions. [2019-12-07 16:20:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:20:32,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-12-07 16:20:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:32,605 INFO L225 Difference]: With dead ends: 3388 [2019-12-07 16:20:32,605 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 16:20:32,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 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 16:20:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 16:20:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2019-12-07 16:20:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-12-07 16:20:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2352 transitions. [2019-12-07 16:20:32,642 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2352 transitions. Word has length 412 [2019-12-07 16:20:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:32,643 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 2352 transitions. [2019-12-07 16:20:32,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:20:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2352 transitions. [2019-12-07 16:20:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-12-07 16:20:32,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:32,647 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:32,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:32,848 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1169353227, now seen corresponding path program 1 times [2019-12-07 16:20:32,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:32,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698878152] [2019-12-07 16:20:32,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 420 proven. 65 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-12-07 16:20:33,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698878152] [2019-12-07 16:20:33,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257934992] [2019-12-07 16:20:33,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:33,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:20:33,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-12-07 16:20:33,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:20:33,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-12-07 16:20:33,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778010613] [2019-12-07 16:20:33,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:20:33,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:20:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:20:33,725 INFO L87 Difference]: Start difference. First operand 2140 states and 2352 transitions. Second operand 7 states. [2019-12-07 16:20:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:34,207 INFO L93 Difference]: Finished difference Result 4378 states and 4811 transitions. [2019-12-07 16:20:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:20:34,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 414 [2019-12-07 16:20:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:34,215 INFO L225 Difference]: With dead ends: 4378 [2019-12-07 16:20:34,215 INFO L226 Difference]: Without dead ends: 2318 [2019-12-07 16:20:34,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:20:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-07 16:20:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2019-12-07 16:20:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-12-07 16:20:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2302 transitions. [2019-12-07 16:20:34,242 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2302 transitions. Word has length 414 [2019-12-07 16:20:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:34,242 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 2302 transitions. [2019-12-07 16:20:34,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:20:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2302 transitions. [2019-12-07 16:20:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 16:20:34,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:34,246 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:34,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:34,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2096484788, now seen corresponding path program 1 times [2019-12-07 16:20:34,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:34,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78668579] [2019-12-07 16:20:34,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-12-07 16:20:35,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78668579] [2019-12-07 16:20:35,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:35,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:20:35,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339139957] [2019-12-07 16:20:35,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:20:35,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:20:35,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:35,174 INFO L87 Difference]: Start difference. First operand 2140 states and 2302 transitions. Second operand 8 states. [2019-12-07 16:20:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:36,032 INFO L93 Difference]: Finished difference Result 4290 states and 4624 transitions. [2019-12-07 16:20:36,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:20:36,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 517 [2019-12-07 16:20:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:36,040 INFO L225 Difference]: With dead ends: 4290 [2019-12-07 16:20:36,040 INFO L226 Difference]: Without dead ends: 2330 [2019-12-07 16:20:36,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:20:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2019-12-07 16:20:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2318. [2019-12-07 16:20:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 16:20:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2484 transitions. [2019-12-07 16:20:36,062 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2484 transitions. Word has length 517 [2019-12-07 16:20:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:36,063 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2484 transitions. [2019-12-07 16:20:36,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:20:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2484 transitions. [2019-12-07 16:20:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-12-07 16:20:36,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:36,066 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:36,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash -111934088, now seen corresponding path program 1 times [2019-12-07 16:20:36,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:36,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235633176] [2019-12-07 16:20:36,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 591 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-12-07 16:20:36,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235633176] [2019-12-07 16:20:36,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647105438] [2019-12-07 16:20:36,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:36,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:20:36,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:36,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:20:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 572 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-12-07 16:20:37,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:20:37,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 16:20:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248101629] [2019-12-07 16:20:37,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:20:37,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:20:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:37,118 INFO L87 Difference]: Start difference. First operand 2318 states and 2484 transitions. Second operand 8 states. [2019-12-07 16:20:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:38,279 INFO L93 Difference]: Finished difference Result 4670 states and 5004 transitions. [2019-12-07 16:20:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:20:38,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 541 [2019-12-07 16:20:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:38,288 INFO L225 Difference]: With dead ends: 4670 [2019-12-07 16:20:38,288 INFO L226 Difference]: Without dead ends: 2532 [2019-12-07 16:20:38,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:20:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2019-12-07 16:20:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2318. [2019-12-07 16:20:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-12-07 16:20:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2482 transitions. [2019-12-07 16:20:38,311 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2482 transitions. Word has length 541 [2019-12-07 16:20:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:38,312 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2482 transitions. [2019-12-07 16:20:38,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:20:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2482 transitions. [2019-12-07 16:20:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-12-07 16:20:38,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:38,316 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2019-12-07 16:20:38,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:38,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2019-12-07 16:20:38,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:38,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33212622] [2019-12-07 16:20:38,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-12-07 16:20:38,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33212622] [2019-12-07 16:20:38,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:38,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:20:38,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633756925] [2019-12-07 16:20:38,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:20:38,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:20:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:38,839 INFO L87 Difference]: Start difference. First operand 2318 states and 2482 transitions. Second operand 3 states. [2019-12-07 16:20:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:39,193 INFO L93 Difference]: Finished difference Result 5346 states and 5778 transitions. [2019-12-07 16:20:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:20:39,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2019-12-07 16:20:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:39,203 INFO L225 Difference]: With dead ends: 5346 [2019-12-07 16:20:39,203 INFO L226 Difference]: Without dead ends: 3208 [2019-12-07 16:20:39,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-12-07 16:20:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-12-07 16:20:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-12-07 16:20:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3273 transitions. [2019-12-07 16:20:39,232 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3273 transitions. Word has length 630 [2019-12-07 16:20:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:39,232 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3273 transitions. [2019-12-07 16:20:39,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:20:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3273 transitions. [2019-12-07 16:20:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-12-07 16:20:39,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:39,237 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:39,237 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 740978942, now seen corresponding path program 1 times [2019-12-07 16:20:39,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:39,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403263697] [2019-12-07 16:20:39,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 708 proven. 174 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-12-07 16:20:40,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403263697] [2019-12-07 16:20:40,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424819904] [2019-12-07 16:20:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:40,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:20:40,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 853 proven. 29 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-12-07 16:20:41,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:20:41,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-12-07 16:20:41,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180722728] [2019-12-07 16:20:41,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:20:41,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:20:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:41,026 INFO L87 Difference]: Start difference. First operand 3030 states and 3273 transitions. Second operand 8 states. [2019-12-07 16:20:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:41,924 INFO L93 Difference]: Finished difference Result 6295 states and 6801 transitions. [2019-12-07 16:20:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:20:41,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2019-12-07 16:20:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:41,935 INFO L225 Difference]: With dead ends: 6295 [2019-12-07 16:20:41,935 INFO L226 Difference]: Without dead ends: 3445 [2019-12-07 16:20:41,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 672 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:20:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-12-07 16:20:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3208. [2019-12-07 16:20:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-12-07 16:20:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3455 transitions. [2019-12-07 16:20:41,970 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3455 transitions. Word has length 675 [2019-12-07 16:20:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3455 transitions. [2019-12-07 16:20:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:20:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3455 transitions. [2019-12-07 16:20:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-12-07 16:20:41,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:41,975 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, 6, 6, 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, 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, 1, 1] [2019-12-07 16:20:42,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:42,176 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 286131592, now seen corresponding path program 1 times [2019-12-07 16:20:42,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:42,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316759809] [2019-12-07 16:20:42,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-12-07 16:20:42,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316759809] [2019-12-07 16:20:42,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:42,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:20:42,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292714097] [2019-12-07 16:20:42,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:20:42,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:20:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:42,472 INFO L87 Difference]: Start difference. First operand 3208 states and 3455 transitions. Second operand 3 states. [2019-12-07 16:20:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:42,804 INFO L93 Difference]: Finished difference Result 7126 states and 7695 transitions. [2019-12-07 16:20:42,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:20:42,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-12-07 16:20:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:42,816 INFO L225 Difference]: With dead ends: 7126 [2019-12-07 16:20:42,817 INFO L226 Difference]: Without dead ends: 4098 [2019-12-07 16:20:42,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-12-07 16:20:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-12-07 16:20:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-12-07 16:20:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4396 transitions. [2019-12-07 16:20:42,867 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4396 transitions. Word has length 702 [2019-12-07 16:20:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:42,867 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4396 transitions. [2019-12-07 16:20:42,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:20:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4396 transitions. [2019-12-07 16:20:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-12-07 16:20:42,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:42,877 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, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:42,877 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2019-12-07 16:20:42,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:42,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194544234] [2019-12-07 16:20:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-12-07 16:20:43,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194544234] [2019-12-07 16:20:43,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:43,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:20:43,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792257395] [2019-12-07 16:20:43,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:43,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:43,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:43,422 INFO L87 Difference]: Start difference. First operand 4098 states and 4396 transitions. Second operand 4 states. [2019-12-07 16:20:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:44,032 INFO L93 Difference]: Finished difference Result 9796 states and 10618 transitions. [2019-12-07 16:20:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:44,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 857 [2019-12-07 16:20:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:44,051 INFO L225 Difference]: With dead ends: 9796 [2019-12-07 16:20:44,051 INFO L226 Difference]: Without dead ends: 5878 [2019-12-07 16:20:44,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-12-07 16:20:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-12-07 16:20:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 16:20:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5904 transitions. [2019-12-07 16:20:44,105 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5904 transitions. Word has length 857 [2019-12-07 16:20:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:44,106 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5904 transitions. [2019-12-07 16:20:44,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5904 transitions. [2019-12-07 16:20:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-12-07 16:20:44,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:44,112 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, 7, 7, 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, 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, 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 16:20:44,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash -948706177, now seen corresponding path program 1 times [2019-12-07 16:20:44,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:44,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996794771] [2019-12-07 16:20:44,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-12-07 16:20:45,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996794771] [2019-12-07 16:20:45,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:45,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:20:45,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116452434] [2019-12-07 16:20:45,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:20:45,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:20:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:20:45,430 INFO L87 Difference]: Start difference. First operand 5522 states and 5904 transitions. Second operand 7 states. [2019-12-07 16:20:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:46,085 INFO L93 Difference]: Finished difference Result 11223 states and 11993 transitions. [2019-12-07 16:20:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:20:46,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 875 [2019-12-07 16:20:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:46,093 INFO L225 Difference]: With dead ends: 11223 [2019-12-07 16:20:46,093 INFO L226 Difference]: Without dead ends: 5881 [2019-12-07 16:20:46,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:20:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2019-12-07 16:20:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5522. [2019-12-07 16:20:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 16:20:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5899 transitions. [2019-12-07 16:20:46,138 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5899 transitions. Word has length 875 [2019-12-07 16:20:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:46,138 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5899 transitions. [2019-12-07 16:20:46,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:20:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5899 transitions. [2019-12-07 16:20:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2019-12-07 16:20:46,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:46,144 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, 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:46,145 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2019-12-07 16:20:46,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:46,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863686993] [2019-12-07 16:20:46,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1793 proven. 144 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 16:20:46,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863686993] [2019-12-07 16:20:46,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984109496] [2019-12-07 16:20:46,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:20:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:47,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:20:47,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:47,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:20:47,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:20:47,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:20:47,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:20:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-12-07 16:20:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:20:47,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 16:20:47,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634468615] [2019-12-07 16:20:47,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:20:47,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:20:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:20:47,748 INFO L87 Difference]: Start difference. First operand 5522 states and 5899 transitions. Second operand 9 states. [2019-12-07 16:20:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:49,465 INFO L93 Difference]: Finished difference Result 13002 states and 13878 transitions. [2019-12-07 16:20:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:20:49,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 952 [2019-12-07 16:20:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:49,473 INFO L225 Difference]: With dead ends: 13002 [2019-12-07 16:20:49,473 INFO L226 Difference]: Without dead ends: 7660 [2019-12-07 16:20:49,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 954 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:20:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2019-12-07 16:20:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 6590. [2019-12-07 16:20:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2019-12-07 16:20:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 6927 transitions. [2019-12-07 16:20:49,534 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 6927 transitions. Word has length 952 [2019-12-07 16:20:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:49,535 INFO L462 AbstractCegarLoop]: Abstraction has 6590 states and 6927 transitions. [2019-12-07 16:20:49,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:20:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 6927 transitions. [2019-12-07 16:20:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1175 [2019-12-07 16:20:49,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:49,544 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:20:49,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:49,745 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1931049465, now seen corresponding path program 1 times [2019-12-07 16:20:49,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:49,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469061453] [2019-12-07 16:20:49,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 1191 proven. 0 refuted. 0 times theorem prover too weak. 3439 trivial. 0 not checked. [2019-12-07 16:20:50,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469061453] [2019-12-07 16:20:50,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:50,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:20:50,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187342851] [2019-12-07 16:20:50,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:50,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:50,553 INFO L87 Difference]: Start difference. First operand 6590 states and 6927 transitions. Second operand 4 states. [2019-12-07 16:20:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:51,246 INFO L93 Difference]: Finished difference Result 13534 states and 14263 transitions. [2019-12-07 16:20:51,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:51,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1174 [2019-12-07 16:20:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:51,259 INFO L225 Difference]: With dead ends: 13534 [2019-12-07 16:20:51,259 INFO L226 Difference]: Without dead ends: 7124 [2019-12-07 16:20:51,264 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 16:20:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2019-12-07 16:20:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6056. [2019-12-07 16:20:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 16:20:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6342 transitions. [2019-12-07 16:20:51,318 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6342 transitions. Word has length 1174 [2019-12-07 16:20:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:51,319 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6342 transitions. [2019-12-07 16:20:51,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6342 transitions. [2019-12-07 16:20:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1193 [2019-12-07 16:20:51,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:51,328 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:51,328 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash -525960922, now seen corresponding path program 1 times [2019-12-07 16:20:51,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:51,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536224406] [2019-12-07 16:20:51,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4677 backedges. 1982 proven. 0 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2019-12-07 16:20:52,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536224406] [2019-12-07 16:20:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:20:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138828333] [2019-12-07 16:20:52,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:52,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:52,347 INFO L87 Difference]: Start difference. First operand 6056 states and 6342 transitions. Second operand 4 states. [2019-12-07 16:20:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:52,882 INFO L93 Difference]: Finished difference Result 12466 states and 13043 transitions. [2019-12-07 16:20:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:52,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1192 [2019-12-07 16:20:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:52,888 INFO L225 Difference]: With dead ends: 12466 [2019-12-07 16:20:52,888 INFO L226 Difference]: Without dead ends: 6590 [2019-12-07 16:20:52,892 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 16:20:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2019-12-07 16:20:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6234. [2019-12-07 16:20:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-07 16:20:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6513 transitions. [2019-12-07 16:20:52,941 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6513 transitions. Word has length 1192 [2019-12-07 16:20:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:52,942 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6513 transitions. [2019-12-07 16:20:52,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6513 transitions. [2019-12-07 16:20:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2019-12-07 16:20:52,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:52,958 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:52,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1677268664, now seen corresponding path program 1 times [2019-12-07 16:20:52,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:52,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991432819] [2019-12-07 16:20:52,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8656 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 8046 trivial. 0 not checked. [2019-12-07 16:20:54,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991432819] [2019-12-07 16:20:54,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:20:54,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866185448] [2019-12-07 16:20:54,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:54,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:54,452 INFO L87 Difference]: Start difference. First operand 6234 states and 6513 transitions. Second operand 4 states. [2019-12-07 16:20:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:54,966 INFO L93 Difference]: Finished difference Result 12466 states and 13024 transitions. [2019-12-07 16:20:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:54,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1645 [2019-12-07 16:20:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:54,971 INFO L225 Difference]: With dead ends: 12466 [2019-12-07 16:20:54,971 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 16:20:54,974 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 16:20:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 16:20:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6234. [2019-12-07 16:20:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-07 16:20:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6480 transitions. [2019-12-07 16:20:55,024 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6480 transitions. Word has length 1645 [2019-12-07 16:20:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:55,025 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6480 transitions. [2019-12-07 16:20:55,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6480 transitions. [2019-12-07 16:20:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2019-12-07 16:20:55,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:55,040 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:55,041 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 698233105, now seen corresponding path program 1 times [2019-12-07 16:20:55,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:55,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384607280] [2019-12-07 16:20:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2019-12-07 16:20:56,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384607280] [2019-12-07 16:20:56,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:56,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:20:56,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121421127] [2019-12-07 16:20:56,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:20:56,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:56,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:20:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:56,653 INFO L87 Difference]: Start difference. First operand 6234 states and 6480 transitions. Second operand 4 states. [2019-12-07 16:20:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:57,217 INFO L93 Difference]: Finished difference Result 13712 states and 14218 transitions. [2019-12-07 16:20:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:20:57,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1662 [2019-12-07 16:20:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:57,220 INFO L225 Difference]: With dead ends: 13712 [2019-12-07 16:20:57,220 INFO L226 Difference]: Without dead ends: 4454 [2019-12-07 16:20:57,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:20:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-12-07 16:20:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2019-12-07 16:20:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-12-07 16:20:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3990 transitions. [2019-12-07 16:20:57,252 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3990 transitions. Word has length 1662 [2019-12-07 16:20:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:57,252 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 3990 transitions. [2019-12-07 16:20:57,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:20:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3990 transitions. [2019-12-07 16:20:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2019-12-07 16:20:57,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:57,267 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:57,267 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1087144341, now seen corresponding path program 1 times [2019-12-07 16:20:57,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:20:57,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738682482] [2019-12-07 16:20:57,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2725 proven. 0 refuted. 0 times theorem prover too weak. 5888 trivial. 0 not checked. [2019-12-07 16:20:59,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738682482] [2019-12-07 16:20:59,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:59,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:20:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219248972] [2019-12-07 16:20:59,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:20:59,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:20:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:20:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:20:59,915 INFO L87 Difference]: Start difference. First operand 3920 states and 3990 transitions. Second operand 7 states. [2019-12-07 16:21:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:00,388 INFO L93 Difference]: Finished difference Result 7542 states and 7683 transitions. [2019-12-07 16:21:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:21:00,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1680 [2019-12-07 16:21:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:00,391 INFO L225 Difference]: With dead ends: 7542 [2019-12-07 16:21:00,391 INFO L226 Difference]: Without dead ends: 4098 [2019-12-07 16:21:00,393 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 16:21:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-12-07 16:21:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-12-07 16:21:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-12-07 16:21:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3987 transitions. [2019-12-07 16:21:00,417 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3987 transitions. Word has length 1680 [2019-12-07 16:21:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:00,418 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 3987 transitions. [2019-12-07 16:21:00,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:21:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3987 transitions. [2019-12-07 16:21:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2019-12-07 16:21:00,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:00,433 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:21:00,434 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2019243921, now seen corresponding path program 1 times [2019-12-07 16:21:00,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:21:00,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357806333] [2019-12-07 16:21:00,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:21:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2019-12-07 16:21:02,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357806333] [2019-12-07 16:21:02,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:02,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:21:02,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451686158] [2019-12-07 16:21:02,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:21:02,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:21:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:21:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:21:02,102 INFO L87 Difference]: Start difference. First operand 3920 states and 3987 transitions. Second operand 5 states. [2019-12-07 16:21:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:02,706 INFO L93 Difference]: Finished difference Result 5346 states and 5448 transitions. [2019-12-07 16:21:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:21:02,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1733 [2019-12-07 16:21:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:02,711 INFO L225 Difference]: With dead ends: 5346 [2019-12-07 16:21:02,711 INFO L226 Difference]: Without dead ends: 5166 [2019-12-07 16:21:02,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:21:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-12-07 16:21:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-12-07 16:21:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 16:21:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4719 transitions. [2019-12-07 16:21:02,745 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4719 transitions. Word has length 1733 [2019-12-07 16:21:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:02,746 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4719 transitions. [2019-12-07 16:21:02,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:21:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4719 transitions. [2019-12-07 16:21:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2019-12-07 16:21:02,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:02,774 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:21:02,774 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:02,775 INFO L82 PathProgramCache]: Analyzing trace with hash 636915005, now seen corresponding path program 1 times [2019-12-07 16:21:02,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:21:02,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93083533] [2019-12-07 16:21:02,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:21:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2019-12-07 16:21:04,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93083533] [2019-12-07 16:21:04,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:04,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:21:04,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059874420] [2019-12-07 16:21:04,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:21:04,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:21:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:21:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:21:04,406 INFO L87 Difference]: Start difference. First operand 4632 states and 4719 transitions. Second operand 3 states. [2019-12-07 16:21:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:04,700 INFO L93 Difference]: Finished difference Result 8906 states and 9078 transitions. [2019-12-07 16:21:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:21:04,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1738 [2019-12-07 16:21:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:04,704 INFO L225 Difference]: With dead ends: 8906 [2019-12-07 16:21:04,704 INFO L226 Difference]: Without dead ends: 4276 [2019-12-07 16:21:04,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:21:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-12-07 16:21:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3564. [2019-12-07 16:21:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-12-07 16:21:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3607 transitions. [2019-12-07 16:21:04,728 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3607 transitions. Word has length 1738 [2019-12-07 16:21:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:04,729 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3607 transitions. [2019-12-07 16:21:04,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:21:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3607 transitions. [2019-12-07 16:21:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2019-12-07 16:21:04,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:04,744 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:21:04,744 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2092363024, now seen corresponding path program 1 times [2019-12-07 16:21:04,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:21:04,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755702825] [2019-12-07 16:21:04,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:21:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9805 backedges. 6224 proven. 426 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2019-12-07 16:21:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755702825] [2019-12-07 16:21:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095244413] [2019-12-07 16:21:08,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/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 16:21:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:09,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 2097 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:21:09,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9805 backedges. 6650 proven. 0 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2019-12-07 16:21:12,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:21:12,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-12-07 16:21:12,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305171769] [2019-12-07 16:21:12,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:21:12,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:21:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:21:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:21:12,442 INFO L87 Difference]: Start difference. First operand 3564 states and 3607 transitions. Second operand 6 states. [2019-12-07 16:21:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:13,178 INFO L93 Difference]: Finished difference Result 5168 states and 5242 transitions. [2019-12-07 16:21:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:21:13,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1738 [2019-12-07 16:21:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:13,181 INFO L225 Difference]: With dead ends: 5168 [2019-12-07 16:21:13,181 INFO L226 Difference]: Without dead ends: 3742 [2019-12-07 16:21:13,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1744 GetRequests, 1735 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:21:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-12-07 16:21:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2019-12-07 16:21:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-12-07 16:21:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3787 transitions. [2019-12-07 16:21:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3787 transitions. Word has length 1738 [2019-12-07 16:21:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:13,204 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3787 transitions. [2019-12-07 16:21:13,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:21:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3787 transitions. [2019-12-07 16:21:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2019-12-07 16:21:13,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:13,222 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:13,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:21:13,423 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324035, now seen corresponding path program 1 times [2019-12-07 16:21:13,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:21:13,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4187594] [2019-12-07 16:21:13,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:21:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2019-12-07 16:21:16,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4187594] [2019-12-07 16:21:16,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:16,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:21:16,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022232706] [2019-12-07 16:21:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:21:16,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:21:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:21:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:21:16,779 INFO L87 Difference]: Start difference. First operand 3742 states and 3787 transitions. Second operand 7 states. [2019-12-07 16:21:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:17,379 INFO L93 Difference]: Finished difference Result 5039 states and 5107 transitions. [2019-12-07 16:21:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:21:17,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1903 [2019-12-07 16:21:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:17,382 INFO L225 Difference]: With dead ends: 5039 [2019-12-07 16:21:17,382 INFO L226 Difference]: Without dead ends: 3564 [2019-12-07 16:21:17,383 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 16:21:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-12-07 16:21:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2019-12-07 16:21:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-12-07 16:21:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3602 transitions. [2019-12-07 16:21:17,406 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3602 transitions. Word has length 1903 [2019-12-07 16:21:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:17,406 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3602 transitions. [2019-12-07 16:21:17,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:21:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3602 transitions. [2019-12-07 16:21:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2019-12-07 16:21:17,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:17,426 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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] [2019-12-07 16:21:17,426 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1253846088, now seen corresponding path program 1 times [2019-12-07 16:21:17,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:21:17,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096408488] [2019-12-07 16:21:17,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:21:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 16:21:19,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096408488] [2019-12-07 16:21:19,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:19,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:21:19,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980517834] [2019-12-07 16:21:19,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:21:19,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:21:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:21:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:21:19,693 INFO L87 Difference]: Start difference. First operand 3564 states and 3602 transitions. Second operand 5 states. [2019-12-07 16:21:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:20,153 INFO L93 Difference]: Finished difference Result 3742 states and 3781 transitions. [2019-12-07 16:21:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:21:20,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2035 [2019-12-07 16:21:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:20,154 INFO L225 Difference]: With dead ends: 3742 [2019-12-07 16:21:20,155 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:21:20,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:21:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:21:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:21:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:21:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:21:20,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2019-12-07 16:21:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:20,156 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:21:20,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:21:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:21:20,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:21:20,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:21:20,407 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 241 [2019-12-07 16:21:20,628 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 241 [2019-12-07 16:21:21,669 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 209 DAG size of output: 95 [2019-12-07 16:21:22,657 WARN L192 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 95 [2019-12-07 16:21:22,660 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 16:21:22,660 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 16:21:22,661 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 16:21:22,662 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,663 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 16:21:22,664 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,665 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 16:21:22,666 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-12-07 16:21:22,667 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,668 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 16:21:22,669 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,670 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse8 (= ~a15~0 7))) (let ((.cse22 (+ ~a12~0 43)) (.cse15 (not .cse8)) (.cse0 (= ~a24~0 1)) (.cse5 (<= ~a15~0 8)) (.cse21 (<= ~a21~0 6)) (.cse13 (= ~a15~0 8)) (.cse11 (= ~a21~0 9))) (let ((.cse17 (not .cse11)) (.cse4 (= ~a21~0 8)) (.cse6 (<= ~a12~0 73281)) (.cse14 (= ~a21~0 7)) (.cse10 (not .cse13)) (.cse12 (or (and .cse15 .cse5 .cse21) (and .cse0 .cse5 .cse21))) (.cse7 (< 0 .cse22))) (let ((.cse16 (or (and (<= .cse22 0) .cse10 .cse12) (and .cse17 (not .cse4) .cse15 .cse0 .cse10 .cse5 .cse6 .cse7 (not .cse14)) (and .cse0 .cse10 .cse12 .cse7))) (.cse1 (= ~a21~0 10)) (.cse18 (= ~a21~0 6)) (.cse19 (= ~a15~0 5)) (.cse9 (< 80 ~a12~0)) (.cse20 (<= ~a12~0 75)) (.cse2 (= ~a15~0 9)) (.cse3 (<= ~a12~0 11))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= (+ ~a12~0 526768) 0) .cse0 .cse4 .cse2) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9) (and .cse0 .cse10 .cse5 .cse7 .cse11) (and (<= ~a12~0 599999) .cse0 .cse2 .cse9) (and .cse8 .cse0 .cse4 .cse5) (and .cse8 .cse0 .cse12 .cse7) (and .cse13 .cse0 .cse14 (<= (+ ~a12~0 49) 0)) (and (<= ~a12~0 80) .cse15 .cse0 .cse10 .cse5 .cse7) (and .cse13 .cse0 .cse1 .cse9) (and .cse16 .cse3) (and (<= (+ ~a12~0 397559) 0) .cse17 .cse8 .cse0) (and .cse18 .cse0 (= ~a15~0 6)) (and .cse16 .cse1 .cse19) (and .cse15 .cse0 .cse3 .cse5 .cse11) (and .cse13 .cse0 .cse1 .cse3) (and .cse18 .cse0 .cse19) (and .cse20 .cse0 .cse5 .cse7 .cse11) (and .cse13 .cse0 (<= ~a12~0 586307) .cse9 .cse21) (and .cse8 .cse0 .cse14) (and .cse20 .cse0 .cse4 .cse2 .cse7) (and .cse13 .cse0 .cse14 .cse3 .cse7)))))) [2019-12-07 16:21:22,670 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 16:21:22,671 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,672 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse8 (= ~a15~0 7))) (let ((.cse22 (+ ~a12~0 43)) (.cse15 (not .cse8)) (.cse0 (= ~a24~0 1)) (.cse5 (<= ~a15~0 8)) (.cse21 (<= ~a21~0 6)) (.cse13 (= ~a15~0 8)) (.cse11 (= ~a21~0 9))) (let ((.cse17 (not .cse11)) (.cse4 (= ~a21~0 8)) (.cse6 (<= ~a12~0 73281)) (.cse14 (= ~a21~0 7)) (.cse10 (not .cse13)) (.cse12 (or (and .cse15 .cse5 .cse21) (and .cse0 .cse5 .cse21))) (.cse7 (< 0 .cse22))) (let ((.cse16 (or (and (<= .cse22 0) .cse10 .cse12) (and .cse17 (not .cse4) .cse15 .cse0 .cse10 .cse5 .cse6 .cse7 (not .cse14)) (and .cse0 .cse10 .cse12 .cse7))) (.cse1 (= ~a21~0 10)) (.cse18 (= ~a21~0 6)) (.cse19 (= ~a15~0 5)) (.cse9 (< 80 ~a12~0)) (.cse20 (<= ~a12~0 75)) (.cse2 (= ~a15~0 9)) (.cse3 (<= ~a12~0 11))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= (+ ~a12~0 526768) 0) .cse0 .cse4 .cse2) (and .cse0 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9) (and .cse0 .cse10 .cse5 .cse7 .cse11) (and (<= ~a12~0 599999) .cse0 .cse2 .cse9) (and .cse8 .cse0 .cse4 .cse5) (and .cse8 .cse0 .cse12 .cse7) (and .cse13 .cse0 .cse14 (<= (+ ~a12~0 49) 0)) (and (<= ~a12~0 80) .cse15 .cse0 .cse10 .cse5 .cse7) (and .cse13 .cse0 .cse1 .cse9) (and .cse16 .cse3) (and (<= (+ ~a12~0 397559) 0) .cse17 .cse8 .cse0) (and .cse18 .cse0 (= ~a15~0 6)) (and .cse16 .cse1 .cse19) (and .cse15 .cse0 .cse3 .cse5 .cse11) (and .cse13 .cse0 .cse1 .cse3) (and .cse18 .cse0 .cse19) (and .cse20 .cse0 .cse5 .cse7 .cse11) (and .cse13 .cse0 (<= ~a12~0 586307) .cse9 .cse21) (and .cse8 .cse0 .cse14) (and .cse20 .cse0 .cse4 .cse2 .cse7) (and .cse13 .cse0 .cse14 .cse3 .cse7)))))) [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,673 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 16:21:22,674 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 16:21:22,675 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 16:21:22,676 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 16:21:22,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:21:22 BoogieIcfgContainer [2019-12-07 16:21:22,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:21:22,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:21:22,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:21:22,704 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:21:22,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:26" (3/4) ... [2019-12-07 16:21:22,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:21:22,723 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 16:21:22,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:21:22,807 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_674d3a88-e507-4a2e-ae3e-c1dea3a05c19/bin/uautomizer/witness.graphml [2019-12-07 16:21:22,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:21:22,808 INFO L168 Benchmark]: Toolchain (without parser) took 57179.71 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 939.3 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 425.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,808 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:21:22,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,809 INFO L168 Benchmark]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,809 INFO L168 Benchmark]: RCFGBuilder took 842.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.5 MB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,809 INFO L168 Benchmark]: TraceAbstraction took 55740.99 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 931.5 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,809 INFO L168 Benchmark]: Witness Printer took 103.22 ms. Allocated memory is still 4.4 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:22,810 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 842.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.5 MB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55740.99 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 931.5 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 103.22 ms. Allocated memory is still 4.4 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: 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 Derived loop invariant: ((((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || (((a12 + 526768 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || ((((a24 == 1 && a21 == 8) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a15 == 7 && a24 == 1) && 80 < a12)) || ((((a24 == 1 && !(a15 == 8)) && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((a12 <= 599999 && a24 == 1) && a15 == 9) && 80 < a12)) || (((a15 == 7 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a15 == 7 && a24 == 1) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((((a12 <= 80 && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && 0 < a12 + 43)) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((((a12 + 43 <= 0 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) || ((((((((!(a21 == 9) && !(a21 == 8)) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) && !(a21 == 7))) || (((a24 == 1 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a12 <= 11)) || (((a12 + 397559 <= 0 && !(a21 == 9)) && a15 == 7) && a24 == 1)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((((((a12 + 43 <= 0 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) || ((((((((!(a21 == 9) && !(a21 == 8)) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) && !(a21 == 7))) || (((a24 == 1 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a21 == 10) && a15 == 5)) || ((((!(a15 == 7) && a24 == 1) && a12 <= 11) && a15 <= 8) && a21 == 9)) || (((a15 == 8 && a24 == 1) && a21 == 10) && a12 <= 11)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a12 <= 75 && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || ((((a15 == 8 && a24 == 1) && a12 <= 586307) && 80 < a12) && a21 <= 6)) || ((a15 == 7 && a24 == 1) && a21 == 7)) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) || (((a12 + 526768 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || ((((a24 == 1 && a21 == 8) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || ((a15 == 7 && a24 == 1) && 80 < a12)) || ((((a24 == 1 && !(a15 == 8)) && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((a12 <= 599999 && a24 == 1) && a15 == 9) && 80 < a12)) || (((a15 == 7 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a15 == 7 && a24 == 1) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((((a12 <= 80 && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && 0 < a12 + 43)) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((((a12 + 43 <= 0 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) || ((((((((!(a21 == 9) && !(a21 == 8)) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) && !(a21 == 7))) || (((a24 == 1 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a12 <= 11)) || (((a12 + 397559 <= 0 && !(a21 == 9)) && a15 == 7) && a24 == 1)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((((((a12 + 43 <= 0 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) || ((((((((!(a21 == 9) && !(a21 == 8)) && !(a15 == 7)) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) && !(a21 == 7))) || (((a24 == 1 && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a21 == 10) && a15 == 5)) || ((((!(a15 == 7) && a24 == 1) && a12 <= 11) && a15 <= 8) && a21 == 9)) || (((a15 == 8 && a24 == 1) && a21 == 10) && a12 <= 11)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a12 <= 75 && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || ((((a15 == 8 && a24 == 1) && a12 <= 586307) && 80 < a12) && a21 <= 6)) || ((a15 == 7 && a24 == 1) && a21 == 7)) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43) - 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: 53.1s, OverallIterations: 24, TraceHistogramMax: 17, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 1434 SDtfs, 6844 SDslu, 341 SDs, 0 SdLazy, 23538 SolverSat, 2233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5401 GetRequests, 5280 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6590occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 6520 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 102 NumberOfFragments, 1101 HoareAnnotationTreeSize, 3 FomulaSimplifications, 55336 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 24560 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 29123 NumberOfCodeBlocks, 29123 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 29091 ConstructedInterpolants, 0 QuantifiedInterpolants, 99448291 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6551 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 118766/120328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...