./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label51.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/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 82f1252cdfefb15e293400630c3df24cee2c679c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:03:23,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:03:23,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:03:23,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:03:23,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:03:23,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:03:23,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:03:23,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:03:23,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:03:23,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:03:23,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:03:23,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:03:23,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:03:23,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:03:23,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:03:23,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:03:23,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:03:23,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:03:23,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:03:23,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:03:23,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:03:23,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:03:23,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:03:23,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:03:23,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:03:23,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:03:23,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:03:23,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:03:23,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:03:23,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:03:23,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:03:23,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:03:23,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:03:23,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:03:23,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:03:23,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:03:23,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:03:23,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:03:23,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:03:23,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:03:23,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:03:23,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:03:23,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:03:23,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:03:23,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:03:23,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:03:23,400 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:03:23,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:03:23,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:03:23,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:03:23,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:03:23,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:03:23,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:03:23,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:03:23,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:03:23,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:03:23,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:03:23,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:03:23,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:03:23,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:03:23,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:03:23,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:03:23,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:03:23,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:03:23,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:03:23,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:03:23,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:03:23,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:03:23,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:03:23,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:03:23,407 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_6605b1d3-e278-4f99-8829-f6a8da0829a1/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 -> 82f1252cdfefb15e293400630c3df24cee2c679c [2019-11-20 10:03:23,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:03:23,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:03:23,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:03:23,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:03:23,612 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:03:23,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2019-11-20 10:03:23,682 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/data/710d46c8a/17ede568c1954ca0a3778a29945fcfb2/FLAGfe8fa0110 [2019-11-20 10:03:24,190 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:03:24,190 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2019-11-20 10:03:24,232 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/data/710d46c8a/17ede568c1954ca0a3778a29945fcfb2/FLAGfe8fa0110 [2019-11-20 10:03:24,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/data/710d46c8a/17ede568c1954ca0a3778a29945fcfb2 [2019-11-20 10:03:24,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:03:24,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:03:24,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:03:24,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:03:24,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:03:24,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:03:24" (1/1) ... [2019-11-20 10:03:24,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1d3fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:24, skipping insertion in model container [2019-11-20 10:03:24,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:03:24" (1/1) ... [2019-11-20 10:03:24,538 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:03:24,617 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:03:25,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:03:25,203 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:03:25,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:03:25,397 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:03:25,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25 WrapperNode [2019-11-20 10:03:25,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:03:25,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:03:25,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:03:25,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:03:25,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:03:25,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:03:25,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:03:25,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:03:25,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... [2019-11-20 10:03:25,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:03:25,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:03:25,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:03:25,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:03:25,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:03:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:03:25,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:03:27,422 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:03:27,423 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:03:27,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:27 BoogieIcfgContainer [2019-11-20 10:03:27,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:03:27,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:03:27,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:03:27,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:03:27,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:03:24" (1/3) ... [2019-11-20 10:03:27,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c803ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:03:27, skipping insertion in model container [2019-11-20 10:03:27,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:03:25" (2/3) ... [2019-11-20 10:03:27,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c803ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:03:27, skipping insertion in model container [2019-11-20 10:03:27,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:27" (3/3) ... [2019-11-20 10:03:27,435 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2019-11-20 10:03:27,446 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:03:27,455 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:03:27,468 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:03:27,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:03:27,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:03:27,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:03:27,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:03:27,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:03:27,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:03:27,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:03:27,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:03:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-20 10:03:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:03:27,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:27,554 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] [2019-11-20 10:03:27,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2019-11-20 10:03:27,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:27,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352706902] [2019-11-20 10:03:27,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:03:27,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352706902] [2019-11-20 10:03:27,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:27,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:03:27,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510259582] [2019-11-20 10:03:27,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:03:27,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:03:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:27,905 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-20 10:03:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:30,101 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-20 10:03:30,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:03:30,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 10:03:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:30,123 INFO L225 Difference]: With dead ends: 866 [2019-11-20 10:03:30,124 INFO L226 Difference]: Without dead ends: 538 [2019-11-20 10:03:30,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-20 10:03:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-20 10:03:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-20 10:03:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-11-20 10:03:30,213 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 35 [2019-11-20 10:03:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:30,214 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-11-20 10:03:30,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:03:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-11-20 10:03:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 10:03:30,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:30,222 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:30,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -545911462, now seen corresponding path program 1 times [2019-11-20 10:03:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104215529] [2019-11-20 10:03:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:03:30,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104215529] [2019-11-20 10:03:30,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:03:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176138937] [2019-11-20 10:03:30,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:03:30,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:03:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:30,777 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-11-20 10:03:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:32,865 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-11-20 10:03:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:03:32,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-11-20 10:03:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:32,876 INFO L225 Difference]: With dead ends: 1964 [2019-11-20 10:03:32,876 INFO L226 Difference]: Without dead ends: 1428 [2019-11-20 10:03:32,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:03:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-20 10:03:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-11-20 10:03:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-20 10:03:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-11-20 10:03:32,964 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 143 [2019-11-20 10:03:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:32,968 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-11-20 10:03:32,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:03:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-11-20 10:03:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 10:03:32,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:32,981 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:32,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1795619338, now seen corresponding path program 1 times [2019-11-20 10:03:32,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:32,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657487291] [2019-11-20 10:03:32,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 10:03:33,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657487291] [2019-11-20 10:03:33,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:33,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:03:33,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987447761] [2019-11-20 10:03:33,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:03:33,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:03:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:33,209 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-11-20 10:03:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:34,689 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-11-20 10:03:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:03:34,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-20 10:03:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:34,708 INFO L225 Difference]: With dead ends: 3922 [2019-11-20 10:03:34,708 INFO L226 Difference]: Without dead ends: 2674 [2019-11-20 10:03:34,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-20 10:03:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-20 10:03:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-20 10:03:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-11-20 10:03:34,783 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 209 [2019-11-20 10:03:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:34,785 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-11-20 10:03:34,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:03:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-11-20 10:03:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 10:03:34,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:34,799 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:34,799 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -853230355, now seen corresponding path program 1 times [2019-11-20 10:03:34,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:34,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251303653] [2019-11-20 10:03:34,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 136 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 10:03:35,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251303653] [2019-11-20 10:03:35,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871083253] [2019-11-20 10:03:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:35,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:03:35,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 10:03:35,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:35,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:03:35,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913291318] [2019-11-20 10:03:35,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:03:35,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:35,487 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 3 states. [2019-11-20 10:03:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:36,478 INFO L93 Difference]: Finished difference Result 4456 states and 5716 transitions. [2019-11-20 10:03:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-20 10:03:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:36,494 INFO L225 Difference]: With dead ends: 4456 [2019-11-20 10:03:36,495 INFO L226 Difference]: Without dead ends: 2318 [2019-11-20 10:03:36,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-20 10:03:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-20 10:03:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-20 10:03:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2817 transitions. [2019-11-20 10:03:36,566 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2817 transitions. Word has length 223 [2019-11-20 10:03:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:36,567 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2817 transitions. [2019-11-20 10:03:36,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:03:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2817 transitions. [2019-11-20 10:03:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-20 10:03:36,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:36,575 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:36,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:36,779 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -993849494, now seen corresponding path program 1 times [2019-11-20 10:03:36,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:36,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371608612] [2019-11-20 10:03:36,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 10:03:37,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371608612] [2019-11-20 10:03:37,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054491500] [2019-11-20 10:03:37,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:37,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:03:37,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-20 10:03:37,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:37,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:03:37,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293031431] [2019-11-20 10:03:37,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:03:37,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:37,448 INFO L87 Difference]: Start difference. First operand 2318 states and 2817 transitions. Second operand 3 states. [2019-11-20 10:03:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:38,356 INFO L93 Difference]: Finished difference Result 5880 states and 7234 transitions. [2019-11-20 10:03:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:38,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-20 10:03:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:38,387 INFO L225 Difference]: With dead ends: 5880 [2019-11-20 10:03:38,388 INFO L226 Difference]: Without dead ends: 3742 [2019-11-20 10:03:38,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-20 10:03:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-11-20 10:03:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-20 10:03:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4207 transitions. [2019-11-20 10:03:38,479 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4207 transitions. Word has length 292 [2019-11-20 10:03:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:38,480 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 4207 transitions. [2019-11-20 10:03:38,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:03:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4207 transitions. [2019-11-20 10:03:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 10:03:38,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:38,488 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:38,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:38,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1870613307, now seen corresponding path program 1 times [2019-11-20 10:03:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:38,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264427088] [2019-11-20 10:03:38,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 10:03:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264427088] [2019-11-20 10:03:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754357539] [2019-11-20 10:03:39,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:39,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:03:39,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-20 10:03:39,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:39,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:03:39,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953693415] [2019-11-20 10:03:39,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:03:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:39,227 INFO L87 Difference]: Start difference. First operand 3564 states and 4207 transitions. Second operand 3 states. [2019-11-20 10:03:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:40,277 INFO L93 Difference]: Finished difference Result 7838 states and 9371 transitions. [2019-11-20 10:03:40,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:40,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 10:03:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:40,305 INFO L225 Difference]: With dead ends: 7838 [2019-11-20 10:03:40,305 INFO L226 Difference]: Without dead ends: 4454 [2019-11-20 10:03:40,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-20 10:03:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-11-20 10:03:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-20 10:03:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5193 transitions. [2019-11-20 10:03:40,411 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5193 transitions. Word has length 305 [2019-11-20 10:03:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:40,412 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 5193 transitions. [2019-11-20 10:03:40,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:03:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5193 transitions. [2019-11-20 10:03:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-20 10:03:40,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:40,420 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:40,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:40,624 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash 438066137, now seen corresponding path program 1 times [2019-11-20 10:03:40,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:40,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076356789] [2019-11-20 10:03:40,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 10:03:40,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076356789] [2019-11-20 10:03:40,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668011542] [2019-11-20 10:03:40,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:41,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:03:41,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 10:03:41,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:03:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29173887] [2019-11-20 10:03:41,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:03:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:41,188 INFO L87 Difference]: Start difference. First operand 4454 states and 5193 transitions. Second operand 3 states. [2019-11-20 10:03:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:42,132 INFO L93 Difference]: Finished difference Result 9974 states and 11706 transitions. [2019-11-20 10:03:42,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:42,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-20 10:03:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:42,160 INFO L225 Difference]: With dead ends: 9974 [2019-11-20 10:03:42,160 INFO L226 Difference]: Without dead ends: 4988 [2019-11-20 10:03:42,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-20 10:03:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 3920. [2019-11-20 10:03:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-20 10:03:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4561 transitions. [2019-11-20 10:03:42,264 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4561 transitions. Word has length 313 [2019-11-20 10:03:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:42,265 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4561 transitions. [2019-11-20 10:03:42,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:03:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4561 transitions. [2019-11-20 10:03:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-20 10:03:42,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:42,272 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:42,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:42,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1982666170, now seen corresponding path program 1 times [2019-11-20 10:03:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892639993] [2019-11-20 10:03:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 10:03:42,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892639993] [2019-11-20 10:03:42,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195440505] [2019-11-20 10:03:42,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:43,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:03:43,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 10:03:43,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:43,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 10:03:43,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471219445] [2019-11-20 10:03:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:03:43,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:43,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:03:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:43,164 INFO L87 Difference]: Start difference. First operand 3920 states and 4561 transitions. Second operand 4 states. [2019-11-20 10:03:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:44,036 INFO L93 Difference]: Finished difference Result 7689 states and 8958 transitions. [2019-11-20 10:03:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:03:44,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-11-20 10:03:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:44,053 INFO L225 Difference]: With dead ends: 7689 [2019-11-20 10:03:44,053 INFO L226 Difference]: Without dead ends: 4098 [2019-11-20 10:03:44,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:03:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-20 10:03:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-11-20 10:03:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-20 10:03:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4186 transitions. [2019-11-20 10:03:44,131 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4186 transitions. Word has length 324 [2019-11-20 10:03:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:44,132 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4186 transitions. [2019-11-20 10:03:44,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:03:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4186 transitions. [2019-11-20 10:03:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 10:03:44,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:44,144 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:44,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:44,348 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1057538892, now seen corresponding path program 1 times [2019-11-20 10:03:44,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:44,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658490623] [2019-11-20 10:03:44,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 411 proven. 65 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-20 10:03:45,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658490623] [2019-11-20 10:03:45,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992669191] [2019-11-20 10:03:45,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:45,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:03:45,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 10:03:45,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:45,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-20 10:03:45,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288468030] [2019-11-20 10:03:45,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:03:45,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:45,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:03:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:03:45,675 INFO L87 Difference]: Start difference. First operand 3920 states and 4186 transitions. Second operand 7 states. [2019-11-20 10:03:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:46,436 INFO L93 Difference]: Finished difference Result 7710 states and 8241 transitions. [2019-11-20 10:03:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:03:46,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-11-20 10:03:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:46,455 INFO L225 Difference]: With dead ends: 7710 [2019-11-20 10:03:46,455 INFO L226 Difference]: Without dead ends: 4098 [2019-11-20 10:03:46,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:03:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-20 10:03:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-11-20 10:03:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-20 10:03:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4116 transitions. [2019-11-20 10:03:46,534 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4116 transitions. Word has length 419 [2019-11-20 10:03:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:46,535 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4116 transitions. [2019-11-20 10:03:46,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:03:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4116 transitions. [2019-11-20 10:03:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-11-20 10:03:46,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:46,546 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:46,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:46,749 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 798665016, now seen corresponding path program 1 times [2019-11-20 10:03:46,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:46,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479395791] [2019-11-20 10:03:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 1190 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-20 10:03:47,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479395791] [2019-11-20 10:03:47,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:47,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:03:47,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109612336] [2019-11-20 10:03:47,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:03:47,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:03:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:47,392 INFO L87 Difference]: Start difference. First operand 3920 states and 4116 transitions. Second operand 4 states. [2019-11-20 10:03:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:48,265 INFO L93 Difference]: Finished difference Result 8906 states and 9424 transitions. [2019-11-20 10:03:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:03:48,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 749 [2019-11-20 10:03:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:48,284 INFO L225 Difference]: With dead ends: 8906 [2019-11-20 10:03:48,292 INFO L226 Difference]: Without dead ends: 5166 [2019-11-20 10:03:48,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:03:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-20 10:03:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2019-11-20 10:03:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-20 10:03:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5242 transitions. [2019-11-20 10:03:48,384 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5242 transitions. Word has length 749 [2019-11-20 10:03:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:48,385 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5242 transitions. [2019-11-20 10:03:48,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:03:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5242 transitions. [2019-11-20 10:03:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2019-11-20 10:03:48,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:48,396 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:48,396 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 738870712, now seen corresponding path program 1 times [2019-11-20 10:03:48,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:48,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925133461] [2019-11-20 10:03:48,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 989 proven. 4 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-11-20 10:03:49,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925133461] [2019-11-20 10:03:49,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876708524] [2019-11-20 10:03:49,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/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-11-20 10:03:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:49,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:03:49,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-11-20 10:03:50,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:03:50,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 10:03:50,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495539166] [2019-11-20 10:03:50,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:03:50,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:03:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:03:50,178 INFO L87 Difference]: Start difference. First operand 4988 states and 5242 transitions. Second operand 3 states. [2019-11-20 10:03:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:50,706 INFO L93 Difference]: Finished difference Result 9796 states and 10306 transitions. [2019-11-20 10:03:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:03:50,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 797 [2019-11-20 10:03:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:50,716 INFO L225 Difference]: With dead ends: 9796 [2019-11-20 10:03:50,716 INFO L226 Difference]: Without dead ends: 5166 [2019-11-20 10:03:50,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:03:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-20 10:03:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2019-11-20 10:03:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-20 10:03:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5033 transitions. [2019-11-20 10:03:50,798 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5033 transitions. Word has length 797 [2019-11-20 10:03:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:50,799 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5033 transitions. [2019-11-20 10:03:50,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:03:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5033 transitions. [2019-11-20 10:03:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2019-11-20 10:03:50,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:50,812 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:51,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:51,016 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:51,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1407042162, now seen corresponding path program 1 times [2019-11-20 10:03:51,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:51,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902343770] [2019-11-20 10:03:51,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 1011 proven. 4 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 10:03:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902343770] [2019-11-20 10:03:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051055058] [2019-11-20 10:03:52,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/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-11-20 10:03:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:52,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:03:52,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:03:52,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:03:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 992 proven. 23 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 10:03:53,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:03:53,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-20 10:03:53,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917415628] [2019-11-20 10:03:53,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:03:53,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:03:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:03:53,591 INFO L87 Difference]: Start difference. First operand 4810 states and 5033 transitions. Second operand 8 states. [2019-11-20 10:03:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:55,285 INFO L93 Difference]: Finished difference Result 9687 states and 10140 transitions. [2019-11-20 10:03:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:03:55,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 820 [2019-11-20 10:03:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:55,296 INFO L225 Difference]: With dead ends: 9687 [2019-11-20 10:03:55,296 INFO L226 Difference]: Without dead ends: 5235 [2019-11-20 10:03:55,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:03:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2019-11-20 10:03:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4632. [2019-11-20 10:03:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 10:03:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4853 transitions. [2019-11-20 10:03:55,381 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4853 transitions. Word has length 820 [2019-11-20 10:03:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:55,382 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4853 transitions. [2019-11-20 10:03:55,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:03:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4853 transitions. [2019-11-20 10:03:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2019-11-20 10:03:55,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:55,398 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-20 10:03:55,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:03:55,613 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:55,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 980114751, now seen corresponding path program 1 times [2019-11-20 10:03:55,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:55,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433485935] [2019-11-20 10:03:55,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:03:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1690 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-20 10:03:57,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433485935] [2019-11-20 10:03:57,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:03:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:03:57,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377633660] [2019-11-20 10:03:57,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:03:57,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:03:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:03:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:03:57,508 INFO L87 Difference]: Start difference. First operand 4632 states and 4853 transitions. Second operand 7 states. [2019-11-20 10:03:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:03:58,485 INFO L93 Difference]: Finished difference Result 9621 states and 10071 transitions. [2019-11-20 10:03:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:03:58,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 909 [2019-11-20 10:03:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:03:58,493 INFO L225 Difference]: With dead ends: 9621 [2019-11-20 10:03:58,494 INFO L226 Difference]: Without dead ends: 4991 [2019-11-20 10:03:58,498 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-11-20 10:03:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-11-20 10:03:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4632. [2019-11-20 10:03:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 10:03:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4850 transitions. [2019-11-20 10:03:58,568 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4850 transitions. Word has length 909 [2019-11-20 10:03:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:03:58,569 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4850 transitions. [2019-11-20 10:03:58,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:03:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4850 transitions. [2019-11-20 10:03:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2019-11-20 10:03:58,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:03:58,583 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:03:58,583 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:03:58,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:03:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2037086168, now seen corresponding path program 1 times [2019-11-20 10:03:58,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:03:58,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713734997] [2019-11-20 10:03:58,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:03:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 738 proven. 257 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-20 10:04:00,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713734997] [2019-11-20 10:04:00,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797290168] [2019-11-20 10:04:00,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:00,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:04:00,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:00,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:00,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 985 proven. 10 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-20 10:04:02,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:04:02,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-20 10:04:02,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125667195] [2019-11-20 10:04:02,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:04:02,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:04:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:04:02,018 INFO L87 Difference]: Start difference. First operand 4632 states and 4850 transitions. Second operand 13 states. [2019-11-20 10:04:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:03,350 INFO L93 Difference]: Finished difference Result 9506 states and 9947 transitions. [2019-11-20 10:04:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:04:03,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 986 [2019-11-20 10:04:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:03,361 INFO L225 Difference]: With dead ends: 9506 [2019-11-20 10:04:03,361 INFO L226 Difference]: Without dead ends: 4876 [2019-11-20 10:04:03,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 982 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:04:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2019-11-20 10:04:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4632. [2019-11-20 10:04:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-20 10:04:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4820 transitions. [2019-11-20 10:04:03,436 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4820 transitions. Word has length 986 [2019-11-20 10:04:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:03,438 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4820 transitions. [2019-11-20 10:04:03,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:04:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4820 transitions. [2019-11-20 10:04:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-11-20 10:04:03,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:03,452 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 1] [2019-11-20 10:04:03,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:03,660 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash 538441961, now seen corresponding path program 1 times [2019-11-20 10:04:03,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:03,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109496252] [2019-11-20 10:04:03,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2376 proven. 140 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2019-11-20 10:04:04,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109496252] [2019-11-20 10:04:04,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786243729] [2019-11-20 10:04:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:05,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:04:05,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:05,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:05,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:05,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:05,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2453 proven. 616 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-11-20 10:04:05,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:04:05,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-20 10:04:05,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074258925] [2019-11-20 10:04:05,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:05,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:05,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:05,954 INFO L87 Difference]: Start difference. First operand 4632 states and 4820 transitions. Second operand 7 states. [2019-11-20 10:04:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:08,031 INFO L93 Difference]: Finished difference Result 11220 states and 11687 transitions. [2019-11-20 10:04:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:04:08,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1032 [2019-11-20 10:04:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:08,041 INFO L225 Difference]: With dead ends: 11220 [2019-11-20 10:04:08,041 INFO L226 Difference]: Without dead ends: 6412 [2019-11-20 10:04:08,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1033 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:04:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-20 10:04:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6056. [2019-11-20 10:04:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-20 10:04:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6262 transitions. [2019-11-20 10:04:08,150 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6262 transitions. Word has length 1032 [2019-11-20 10:04:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:08,151 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6262 transitions. [2019-11-20 10:04:08,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6262 transitions. [2019-11-20 10:04:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2019-11-20 10:04:08,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:08,191 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:08,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:08,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -160688465, now seen corresponding path program 1 times [2019-11-20 10:04:08,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:08,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327018682] [2019-11-20 10:04:08,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8277 backedges. 2606 proven. 0 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2019-11-20 10:04:11,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327018682] [2019-11-20 10:04:11,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:11,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:04:11,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117156954] [2019-11-20 10:04:11,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:11,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:11,569 INFO L87 Difference]: Start difference. First operand 6056 states and 6262 transitions. Second operand 7 states. [2019-11-20 10:04:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:12,277 INFO L93 Difference]: Finished difference Result 11696 states and 12089 transitions. [2019-11-20 10:04:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:04:12,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1600 [2019-11-20 10:04:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:12,284 INFO L225 Difference]: With dead ends: 11696 [2019-11-20 10:04:12,284 INFO L226 Difference]: Without dead ends: 5700 [2019-11-20 10:04:12,289 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-11-20 10:04:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-11-20 10:04:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5522. [2019-11-20 10:04:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-20 10:04:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5696 transitions. [2019-11-20 10:04:12,362 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5696 transitions. Word has length 1600 [2019-11-20 10:04:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:12,364 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5696 transitions. [2019-11-20 10:04:12,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5696 transitions. [2019-11-20 10:04:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2019-11-20 10:04:12,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:12,391 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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-11-20 10:04:12,391 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -172671030, now seen corresponding path program 1 times [2019-11-20 10:04:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065754322] [2019-11-20 10:04:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 4898 proven. 29 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2019-11-20 10:04:15,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065754322] [2019-11-20 10:04:15,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179438990] [2019-11-20 10:04:15,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:15,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 1982 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 10:04:15,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:04:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 5716 proven. 514 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-11-20 10:04:20,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:04:20,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-20 10:04:20,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240945092] [2019-11-20 10:04:20,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 10:04:20,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 10:04:20,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:04:20,526 INFO L87 Difference]: Start difference. First operand 5522 states and 5696 transitions. Second operand 14 states. [2019-11-20 10:04:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:25,949 INFO L93 Difference]: Finished difference Result 13890 states and 14375 transitions. [2019-11-20 10:04:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 10:04:25,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1646 [2019-11-20 10:04:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:25,961 INFO L225 Difference]: With dead ends: 13890 [2019-11-20 10:04:25,961 INFO L226 Difference]: Without dead ends: 7836 [2019-11-20 10:04:25,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1672 GetRequests, 1649 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-11-20 10:04:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-11-20 10:04:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 4098. [2019-11-20 10:04:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-20 10:04:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4187 transitions. [2019-11-20 10:04:26,033 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4187 transitions. Word has length 1646 [2019-11-20 10:04:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:26,035 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4187 transitions. [2019-11-20 10:04:26,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 10:04:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4187 transitions. [2019-11-20 10:04:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1668 [2019-11-20 10:04:26,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:26,062 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 10, 10, 10, 9, 8, 8, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:26,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:26,268 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:26,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash -191271911, now seen corresponding path program 1 times [2019-11-20 10:04:26,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:26,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978635012] [2019-11-20 10:04:26,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 2627 proven. 0 refuted. 0 times theorem prover too weak. 5893 trivial. 0 not checked. [2019-11-20 10:04:29,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978635012] [2019-11-20 10:04:29,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:29,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:04:29,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289693617] [2019-11-20 10:04:29,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:29,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:29,869 INFO L87 Difference]: Start difference. First operand 4098 states and 4187 transitions. Second operand 7 states. [2019-11-20 10:04:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:30,781 INFO L93 Difference]: Finished difference Result 8254 states and 8436 transitions. [2019-11-20 10:04:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:04:30,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1667 [2019-11-20 10:04:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:30,787 INFO L225 Difference]: With dead ends: 8254 [2019-11-20 10:04:30,788 INFO L226 Difference]: Without dead ends: 4276 [2019-11-20 10:04:30,791 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-11-20 10:04:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-20 10:04:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-11-20 10:04:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-20 10:04:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4186 transitions. [2019-11-20 10:04:30,841 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4186 transitions. Word has length 1667 [2019-11-20 10:04:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:30,843 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4186 transitions. [2019-11-20 10:04:30,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4186 transitions. [2019-11-20 10:04:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2019-11-20 10:04:30,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:30,893 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, 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, 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, 12, 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, 1] [2019-11-20 10:04:30,894 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash -354861792, now seen corresponding path program 1 times [2019-11-20 10:04:30,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:30,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630298442] [2019-11-20 10:04:30,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 2724 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2019-11-20 10:04:33,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630298442] [2019-11-20 10:04:33,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:33,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:04:33,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68572264] [2019-11-20 10:04:33,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:04:33,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:04:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:04:33,317 INFO L87 Difference]: Start difference. First operand 4098 states and 4186 transitions. Second operand 5 states. [2019-11-20 10:04:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:34,321 INFO L93 Difference]: Finished difference Result 10508 states and 10764 transitions. [2019-11-20 10:04:34,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:04:34,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1813 [2019-11-20 10:04:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:34,327 INFO L225 Difference]: With dead ends: 10508 [2019-11-20 10:04:34,327 INFO L226 Difference]: Without dead ends: 6590 [2019-11-20 10:04:34,330 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-11-20 10:04:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2019-11-20 10:04:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 5344. [2019-11-20 10:04:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-20 10:04:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5485 transitions. [2019-11-20 10:04:34,387 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5485 transitions. Word has length 1813 [2019-11-20 10:04:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5485 transitions. [2019-11-20 10:04:34,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:04:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5485 transitions. [2019-11-20 10:04:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1949 [2019-11-20 10:04:34,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:34,421 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, 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, 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, 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, 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, 1, 1] [2019-11-20 10:04:34,422 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash -962862479, now seen corresponding path program 1 times [2019-11-20 10:04:34,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:34,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844539876] [2019-11-20 10:04:34,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12570 backedges. 4213 proven. 0 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2019-11-20 10:04:38,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844539876] [2019-11-20 10:04:38,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:38,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:04:38,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959992131] [2019-11-20 10:04:38,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:38,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:38,803 INFO L87 Difference]: Start difference. First operand 5344 states and 5485 transitions. Second operand 7 states. [2019-11-20 10:04:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:39,530 INFO L93 Difference]: Finished difference Result 10122 states and 10373 transitions. [2019-11-20 10:04:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:04:39,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1948 [2019-11-20 10:04:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:39,534 INFO L225 Difference]: With dead ends: 10122 [2019-11-20 10:04:39,534 INFO L226 Difference]: Without dead ends: 4665 [2019-11-20 10:04:39,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-20 10:04:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-20 10:04:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-20 10:04:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4585 transitions. [2019-11-20 10:04:39,575 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4585 transitions. Word has length 1948 [2019-11-20 10:04:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:39,576 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4585 transitions. [2019-11-20 10:04:39,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4585 transitions. [2019-11-20 10:04:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1957 [2019-11-20 10:04:39,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:39,601 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-20 10:04:39,601 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1012455035, now seen corresponding path program 1 times [2019-11-20 10:04:39,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:39,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74494434] [2019-11-20 10:04:39,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4245 proven. 0 refuted. 0 times theorem prover too weak. 8355 trivial. 0 not checked. [2019-11-20 10:04:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74494434] [2019-11-20 10:04:43,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:43,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:04:43,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005795265] [2019-11-20 10:04:43,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:43,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:43,721 INFO L87 Difference]: Start difference. First operand 4487 states and 4585 transitions. Second operand 7 states. [2019-11-20 10:04:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:44,340 INFO L93 Difference]: Finished difference Result 9203 states and 9404 transitions. [2019-11-20 10:04:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:04:44,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1956 [2019-11-20 10:04:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:44,344 INFO L225 Difference]: With dead ends: 9203 [2019-11-20 10:04:44,344 INFO L226 Difference]: Without dead ends: 4665 [2019-11-20 10:04:44,346 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-11-20 10:04:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-20 10:04:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-20 10:04:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-20 10:04:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4580 transitions. [2019-11-20 10:04:44,390 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4580 transitions. Word has length 1956 [2019-11-20 10:04:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:44,392 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4580 transitions. [2019-11-20 10:04:44,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4580 transitions. [2019-11-20 10:04:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1984 [2019-11-20 10:04:44,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:44,416 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, 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, 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, 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, 1] [2019-11-20 10:04:44,416 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash -375981036, now seen corresponding path program 1 times [2019-11-20 10:04:44,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:44,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518204991] [2019-11-20 10:04:44,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12681 backedges. 4237 proven. 0 refuted. 0 times theorem prover too weak. 8444 trivial. 0 not checked. [2019-11-20 10:04:48,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518204991] [2019-11-20 10:04:48,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:04:48,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:04:48,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945316708] [2019-11-20 10:04:48,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:04:48,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:04:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:04:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:04:48,844 INFO L87 Difference]: Start difference. First operand 4487 states and 4580 transitions. Second operand 7 states. [2019-11-20 10:04:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:04:49,441 INFO L93 Difference]: Finished difference Result 9199 states and 9390 transitions. [2019-11-20 10:04:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:04:49,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1983 [2019-11-20 10:04:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:04:49,448 INFO L225 Difference]: With dead ends: 9199 [2019-11-20 10:04:49,448 INFO L226 Difference]: Without dead ends: 4665 [2019-11-20 10:04:49,450 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-11-20 10:04:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-20 10:04:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-20 10:04:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-20 10:04:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4575 transitions. [2019-11-20 10:04:49,502 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4575 transitions. Word has length 1983 [2019-11-20 10:04:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:04:49,504 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4575 transitions. [2019-11-20 10:04:49,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:04:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4575 transitions. [2019-11-20 10:04:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2015 [2019-11-20 10:04:49,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:04:49,536 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 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, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:04:49,536 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:04:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:04:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 891606446, now seen corresponding path program 1 times [2019-11-20 10:04:49,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:04:49,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525544800] [2019-11-20 10:04:49,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:04:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9202 proven. 695 refuted. 0 times theorem prover too weak. 3859 trivial. 0 not checked. [2019-11-20 10:04:56,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525544800] [2019-11-20 10:04:56,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208321167] [2019-11-20 10:04:56,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:04:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:04:56,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 2438 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:04:56,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:04:56,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:05:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9287 proven. 184 refuted. 0 times theorem prover too weak. 4285 trivial. 0 not checked. [2019-11-20 10:05:02,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:05:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-20 10:05:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861791869] [2019-11-20 10:05:02,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:05:02,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:05:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:05:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:05:02,553 INFO L87 Difference]: Start difference. First operand 4487 states and 4575 transitions. Second operand 9 states. [2019-11-20 10:05:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:05:04,369 INFO L93 Difference]: Finished difference Result 9403 states and 9585 transitions. [2019-11-20 10:05:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 10:05:04,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2014 [2019-11-20 10:05:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:05:04,375 INFO L225 Difference]: With dead ends: 9403 [2019-11-20 10:05:04,375 INFO L226 Difference]: Without dead ends: 4918 [2019-11-20 10:05:04,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2025 GetRequests, 2012 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:05:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2019-11-20 10:05:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 4487. [2019-11-20 10:05:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-20 10:05:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4561 transitions. [2019-11-20 10:05:04,419 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4561 transitions. Word has length 2014 [2019-11-20 10:05:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:05:04,420 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4561 transitions. [2019-11-20 10:05:04,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:05:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4561 transitions. [2019-11-20 10:05:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2027 [2019-11-20 10:05:04,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:05:04,446 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1] [2019-11-20 10:05:04,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:05:04,646 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:05:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:05:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -680935796, now seen corresponding path program 1 times [2019-11-20 10:05:04,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:05:04,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997155358] [2019-11-20 10:05:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:05:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:05:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13914 backedges. 4419 proven. 0 refuted. 0 times theorem prover too weak. 9495 trivial. 0 not checked. [2019-11-20 10:05:08,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997155358] [2019-11-20 10:05:08,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:05:08,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:05:08,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398218585] [2019-11-20 10:05:08,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:05:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:05:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:05:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:05:08,972 INFO L87 Difference]: Start difference. First operand 4487 states and 4561 transitions. Second operand 4 states. [2019-11-20 10:05:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:05:09,531 INFO L93 Difference]: Finished difference Result 9162 states and 9315 transitions. [2019-11-20 10:05:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:05:09,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2026 [2019-11-20 10:05:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:05:09,535 INFO L225 Difference]: With dead ends: 9162 [2019-11-20 10:05:09,535 INFO L226 Difference]: Without dead ends: 4665 [2019-11-20 10:05:09,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:05:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-11-20 10:05:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4487. [2019-11-20 10:05:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-11-20 10:05:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 4559 transitions. [2019-11-20 10:05:09,592 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 4559 transitions. Word has length 2026 [2019-11-20 10:05:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:05:09,594 INFO L462 AbstractCegarLoop]: Abstraction has 4487 states and 4559 transitions. [2019-11-20 10:05:09,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:05:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 4559 transitions. [2019-11-20 10:05:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2019-11-20 10:05:09,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:05:09,628 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 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, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:05:09,629 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:05:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:05:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 58677289, now seen corresponding path program 1 times [2019-11-20 10:05:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:05:09,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87157468] [2019-11-20 10:05:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:05:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:05:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 3142 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-20 10:05:12,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87157468] [2019-11-20 10:05:12,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:05:12,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:05:12,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621458757] [2019-11-20 10:05:12,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:05:12,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:05:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:05:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:05:12,826 INFO L87 Difference]: Start difference. First operand 4487 states and 4559 transitions. Second operand 5 states. [2019-11-20 10:05:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:05:13,498 INFO L93 Difference]: Finished difference Result 5021 states and 5097 transitions. [2019-11-20 10:05:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:05:13,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2115 [2019-11-20 10:05:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:05:13,500 INFO L225 Difference]: With dead ends: 5021 [2019-11-20 10:05:13,500 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:05:13,501 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-11-20 10:05:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:05:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:05:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:05:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:05:13,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2115 [2019-11-20 10:05:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:05:13,503 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:05:13,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:05:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:05:13,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:05:13,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:05:14,423 WARN L191 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 372 [2019-11-20 10:05:15,190 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 372 [2019-11-20 10:05:18,412 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 351 DAG size of output: 130 [2019-11-20 10:05:21,527 WARN L191 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 351 DAG size of output: 130 [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-20 10:05:21,530 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 10:05:21,531 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 10:05:21,532 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-20 10:05:21,533 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-20 10:05:21,534 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,535 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-20 10:05:21,536 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 10:05:21,537 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 10:05:21,538 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 10:05:21,539 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 10:05:21,540 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-20 10:05:21,544 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-20 10:05:21,544 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-20 10:05:21,544 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-20 10:05:21,544 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,544 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 10:05:21,545 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,546 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-20 10:05:21,547 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 10:05:21,548 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 10:05:21,549 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-20 10:05:21,549 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-20 10:05:21,549 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-20 10:05:21,549 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,549 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse26 (<= ~a12~0 11)) (.cse12 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse14 (<= ~a15~0 8)) (.cse23 (= ~a21~0 9))) (let ((.cse4 (= ~a21~0 6)) (.cse0 (not .cse23)) (.cse21 (and .cse12 .cse2 .cse14)) (.cse13 (<= (+ ~a12~0 42) 0)) (.cse20 (= ~a21~0 8)) (.cse6 (= ~a15~0 5)) (.cse15 (<= ~a12~0 75)) (.cse10 (<= 20 ~a12~0)) (.cse19 (= ~a15~0 7)) (.cse27 (= ~a21~0 10)) (.cse5 (= ~a15~0 6)) (.cse24 (<= ~a21~0 6)) (.cse25 (< 0 (+ ~a12~0 43))) (.cse3 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 599999)) (.cse11 (and .cse26 .cse14)) (.cse8 (= ~a21~0 7)) (.cse1 (= 8 ~a15~0)) (.cse16 (= 8 ~a21~0)) (.cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse28 (<= 0 (+ ~a12~0 41))) (.cse18 (= 9 ~a15~0)) (.cse9 (<= ~a12~0 80)) (.cse7 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a12~0 73281)) (and .cse4 .cse2 .cse5) (and .cse4 .cse2 .cse6) (and .cse7 .cse8) (and (or (and .cse9 .cse0 .cse10 .cse1) (and .cse11 .cse12 .cse1)) .cse2) (and .cse13 .cse2 (and .cse8 .cse14)) (and (and (and .cse15 .cse16 .cse17 (<= 19 ~a12~0)) .cse18) .cse2) (and .cse19 .cse2 .cse3 .cse20) (and .cse21 .cse13) (and .cse22 .cse2 (and .cse3 .cse18 .cse23)) (and (and (or (and .cse3 .cse14 .cse24) (and .cse3 .cse21) .cse7) .cse2) .cse22) (and .cse19 .cse13 .cse2 .cse20) (and .cse2 (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse11 .cse25 .cse23)) (and .cse12 .cse2 .cse26 .cse18) (and (and (and .cse14 (<= (+ ~a12~0 49) 0)) .cse24) .cse2) (and .cse2 (<= 103531 ~a12~0) (and .cse1 .cse24)) (and (and .cse12 .cse1) .cse2 .cse3) (and .cse2 .cse27 .cse6) (and .cse22 (and (or (and .cse12 .cse3) (and .cse3 .cse24)) .cse18) .cse2) (and .cse15 .cse10 (and (and (<= 9 ~a21~0) .cse14) .cse2)) (and .cse19 .cse2 .cse27 .cse3) (and .cse2 .cse23 .cse5) (and .cse28 (and .cse2 (and .cse11 .cse24))) (and (= 7 ~a15~0) .cse2 .cse25 .cse23) (and (and (or (and .cse17 .cse3) (and .cse8 .cse3)) .cse2 .cse18) .cse22) (and .cse16 .cse2 .cse17 (<= (+ ~a12~0 9352) 0) .cse18) (and (and (and .cse11 .cse8) .cse1) .cse2) (and .cse16 .cse17 .cse28 .cse2 .cse26 .cse18) (and .cse9 .cse7)))) [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,550 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 10:05:21,551 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,552 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse26 (<= ~a12~0 11)) (.cse12 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse14 (<= ~a15~0 8)) (.cse23 (= ~a21~0 9))) (let ((.cse4 (= ~a21~0 6)) (.cse0 (not .cse23)) (.cse21 (and .cse12 .cse2 .cse14)) (.cse13 (<= (+ ~a12~0 42) 0)) (.cse20 (= ~a21~0 8)) (.cse6 (= ~a15~0 5)) (.cse15 (<= ~a12~0 75)) (.cse10 (<= 20 ~a12~0)) (.cse19 (= ~a15~0 7)) (.cse27 (= ~a21~0 10)) (.cse5 (= ~a15~0 6)) (.cse24 (<= ~a21~0 6)) (.cse25 (< 0 (+ ~a12~0 43))) (.cse3 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 599999)) (.cse11 (and .cse26 .cse14)) (.cse8 (= ~a21~0 7)) (.cse1 (= 8 ~a15~0)) (.cse16 (= 8 ~a21~0)) (.cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse28 (<= 0 (+ ~a12~0 41))) (.cse18 (= 9 ~a15~0)) (.cse9 (<= ~a12~0 80)) (.cse7 (<= ~a15~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a12~0 73281)) (and .cse4 .cse2 .cse5) (and .cse4 .cse2 .cse6) (and .cse7 .cse8) (and (or (and .cse9 .cse0 .cse10 .cse1) (and .cse11 .cse12 .cse1)) .cse2) (and .cse13 .cse2 (and .cse8 .cse14)) (and (and (and .cse15 .cse16 .cse17 (<= 19 ~a12~0)) .cse18) .cse2) (and .cse19 .cse2 .cse3 .cse20) (and .cse21 .cse13) (and .cse22 .cse2 (and .cse3 .cse18 .cse23)) (and (and (or (and .cse3 .cse14 .cse24) (and .cse3 .cse21) .cse7) .cse2) .cse22) (and .cse19 .cse13 .cse2 .cse20) (and .cse2 (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse11 .cse25 .cse23)) (and .cse12 .cse2 .cse26 .cse18) (and (and (and .cse14 (<= (+ ~a12~0 49) 0)) .cse24) .cse2) (and .cse2 (<= 103531 ~a12~0) (and .cse1 .cse24)) (and (and .cse12 .cse1) .cse2 .cse3) (and .cse2 .cse27 .cse6) (and .cse22 (and (or (and .cse12 .cse3) (and .cse3 .cse24)) .cse18) .cse2) (and .cse15 .cse10 (and (and (<= 9 ~a21~0) .cse14) .cse2)) (and .cse19 .cse2 .cse27 .cse3) (and .cse2 .cse23 .cse5) (and .cse28 (and .cse2 (and .cse11 .cse24))) (and (= 7 ~a15~0) .cse2 .cse25 .cse23) (and (and (or (and .cse17 .cse3) (and .cse8 .cse3)) .cse2 .cse18) .cse22) (and .cse16 .cse2 .cse17 (<= (+ ~a12~0 9352) 0) .cse18) (and (and (and .cse11 .cse8) .cse1) .cse2) (and .cse16 .cse17 .cse28 .cse2 .cse26 .cse18) (and .cse9 .cse7)))) [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,553 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,554 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 10:05:21,555 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 10:05:21,556 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 10:05:21,557 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-20 10:05:21,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:05:21 BoogieIcfgContainer [2019-11-20 10:05:21,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:05:21,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:05:21,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:05:21,621 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:05:21,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:03:27" (3/4) ... [2019-11-20 10:05:21,625 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:05:21,658 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 10:05:21,660 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:05:21,852 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6605b1d3-e278-4f99-8829-f6a8da0829a1/bin/uautomizer/witness.graphml [2019-11-20 10:05:21,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:05:21,854 INFO L168 Benchmark]: Toolchain (without parser) took 117340.67 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 946.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,854 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:05:21,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,855 INFO L168 Benchmark]: Boogie Preprocessor took 123.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,856 INFO L168 Benchmark]: RCFGBuilder took 1766.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.3 MB in the end (delta: 129.9 MB). Peak memory consumption was 129.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,856 INFO L168 Benchmark]: TraceAbstraction took 114194.34 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 951.3 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,857 INFO L168 Benchmark]: Witness Printer took 232.27 ms. Allocated memory is still 5.1 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:05:21,859 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 880.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1766.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.3 MB in the end (delta: 129.9 MB). Peak memory consumption was 129.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 114194.34 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 951.3 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 232.27 ms. Allocated memory is still 5.1 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(a21 == 9) && 8 == a15) && a24 == 1) && 80 < a12) && a12 <= 73281) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 7)) || (((((a12 <= 80 && !(a21 == 9)) && 20 <= a12) && 8 == a15) || (((a12 <= 11 && a15 <= 8) && 10 <= a21) && 8 == a15)) && a24 == 1)) || ((a12 + 42 <= 0 && a24 == 1) && a21 == 7 && a15 <= 8)) || (((((a12 <= 75 && 8 == a21) && !(1 == input)) && 19 <= a12) && 9 == a15) && a24 == 1)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 8)) || (((10 <= a21 && a24 == 1) && a15 <= 8) && a12 + 42 <= 0)) || ((a12 <= 599999 && a24 == 1) && (80 < a12 && 9 == a15) && a21 == 9)) || ((((((80 < a12 && a15 <= 8) && a21 <= 6) || (80 < a12 && (10 <= a21 && a24 == 1) && a15 <= 8)) || a15 <= 6) && a24 == 1) && a12 <= 599999)) || (((a15 == 7 && a12 + 42 <= 0) && a24 == 1) && a21 == 8)) || (a24 == 1 && ((!(5 == input) && a12 <= 11 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((10 <= a21 && a24 == 1) && a12 <= 11) && 9 == a15)) || (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && a24 == 1)) || ((a24 == 1 && 103531 <= a12) && 8 == a15 && a21 <= 6)) || (((10 <= a21 && 8 == a15) && a24 == 1) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 == 5)) || ((a12 <= 599999 && ((10 <= a21 && 80 < a12) || (80 < a12 && a21 <= 6)) && 9 == a15) && a24 == 1)) || ((a12 <= 75 && 20 <= a12) && (9 <= a21 && a15 <= 8) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a24 == 1 && a21 == 9) && a15 == 6)) || (0 <= a12 + 41 && a24 == 1 && (a12 <= 11 && a15 <= 8) && a21 <= 6)) || (((7 == a15 && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (((((!(1 == input) && 80 < a12) || (a21 == 7 && 80 < a12)) && a24 == 1) && 9 == a15) && a12 <= 599999)) || ((((8 == a21 && a24 == 1) && !(1 == input)) && a12 + 9352 <= 0) && 9 == a15)) || ((((a12 <= 11 && a15 <= 8) && a21 == 7) && 8 == a15) && a24 == 1)) || (((((8 == a21 && !(1 == input)) && 0 <= a12 + 41) && a24 == 1) && a12 <= 11) && 9 == a15)) || (a12 <= 80 && a15 <= 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(a21 == 9) && 8 == a15) && a24 == 1) && 80 < a12) && a12 <= 73281) || ((a21 == 6 && a24 == 1) && a15 == 6)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (a15 <= 6 && a21 == 7)) || (((((a12 <= 80 && !(a21 == 9)) && 20 <= a12) && 8 == a15) || (((a12 <= 11 && a15 <= 8) && 10 <= a21) && 8 == a15)) && a24 == 1)) || ((a12 + 42 <= 0 && a24 == 1) && a21 == 7 && a15 <= 8)) || (((((a12 <= 75 && 8 == a21) && !(1 == input)) && 19 <= a12) && 9 == a15) && a24 == 1)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 8)) || (((10 <= a21 && a24 == 1) && a15 <= 8) && a12 + 42 <= 0)) || ((a12 <= 599999 && a24 == 1) && (80 < a12 && 9 == a15) && a21 == 9)) || ((((((80 < a12 && a15 <= 8) && a21 <= 6) || (80 < a12 && (10 <= a21 && a24 == 1) && a15 <= 8)) || a15 <= 6) && a24 == 1) && a12 <= 599999)) || (((a15 == 7 && a12 + 42 <= 0) && a24 == 1) && a21 == 8)) || (a24 == 1 && ((!(5 == input) && a12 <= 11 && a15 <= 8) && 0 < a12 + 43) && a21 == 9)) || (((10 <= a21 && a24 == 1) && a12 <= 11) && 9 == a15)) || (((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && a24 == 1)) || ((a24 == 1 && 103531 <= a12) && 8 == a15 && a21 <= 6)) || (((10 <= a21 && 8 == a15) && a24 == 1) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 == 5)) || ((a12 <= 599999 && ((10 <= a21 && 80 < a12) || (80 < a12 && a21 <= 6)) && 9 == a15) && a24 == 1)) || ((a12 <= 75 && 20 <= a12) && (9 <= a21 && a15 <= 8) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a24 == 1 && a21 == 9) && a15 == 6)) || (0 <= a12 + 41 && a24 == 1 && (a12 <= 11 && a15 <= 8) && a21 <= 6)) || (((7 == a15 && a24 == 1) && 0 < a12 + 43) && a21 == 9)) || (((((!(1 == input) && 80 < a12) || (a21 == 7 && 80 < a12)) && a24 == 1) && 9 == a15) && a12 <= 599999)) || ((((8 == a21 && a24 == 1) && !(1 == input)) && a12 + 9352 <= 0) && 9 == a15)) || ((((a12 <= 11 && a15 <= 8) && a21 == 7) && 8 == a15) && a24 == 1)) || (((((8 == a21 && !(1 == input)) && 0 <= a12 + 41) && a24 == 1) && a12 <= 11) && 9 == a15)) || (a12 <= 80 && a15 <= 6) - 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: 114.0s, OverallIterations: 25, TraceHistogramMax: 18, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, HoareTripleCheckerStatistics: 1845 SDtfs, 8438 SDslu, 428 SDs, 0 SdLazy, 29496 SolverSat, 2310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9337 GetRequests, 9171 SyntacticMatches, 16 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6056occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 10537 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 1005 HoareAnnotationTreeSize, 3 FomulaSimplifications, 99206178 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7512172 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 35495 NumberOfCodeBlocks, 35495 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 35458 ConstructedInterpolants, 33 QuantifiedInterpolants, 168394607 SizeOfPredicates, 31 NumberOfNonLiveVariables, 11387 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 164314/166875 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...