./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:51:59,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:59,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:59,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:59,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:59,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:59,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:59,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:59,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:59,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:59,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:59,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:59,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:59,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:59,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:59,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:59,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:59,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:59,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:59,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:59,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:59,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:59,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:59,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:59,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:59,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:59,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:59,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:59,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:59,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:59,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:59,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:59,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:59,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:59,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:59,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:59,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:59,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:59,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:59,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:59,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:59,467 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:51:59,479 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:59,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:59,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:59,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:59,481 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:59,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:59,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:59,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:59,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:59,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:59,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:59,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:51:59,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:59,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:59,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:51:59,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:51:59,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:51:59,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:59,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:51:59,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:51:59,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:59,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:51:59,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:51:59,485 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_d10b5006-5335-40f2-8109-c327d616a656/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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2019-11-25 08:51:59,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:59,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:59,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:59,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:59,654 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:59,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-25 08:51:59,725 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/data/cc046b13c/14bdadc33db148dbbd319de70a9459bd/FLAGa222aa114 [2019-11-25 08:52:00,094 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:00,095 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-25 08:52:00,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/data/cc046b13c/14bdadc33db148dbbd319de70a9459bd/FLAGa222aa114 [2019-11-25 08:52:00,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/data/cc046b13c/14bdadc33db148dbbd319de70a9459bd [2019-11-25 08:52:00,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:00,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:00,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:00,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:00,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:00,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc26540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00, skipping insertion in model container [2019-11-25 08:52:00,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:00,601 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:00,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:00,854 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:00,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:00,919 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:00,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00 WrapperNode [2019-11-25 08:52:00,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:00,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:00,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:00,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:00,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:00,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:00,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:00,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:00,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... [2019-11-25 08:52:00,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:00,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:00,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:00,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:00,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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-25 08:52:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:01,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:01,499 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:01,499 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:52:01,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:01 BoogieIcfgContainer [2019-11-25 08:52:01,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:01,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:01,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:01,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:01,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:00" (1/3) ... [2019-11-25 08:52:01,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e72321e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:01, skipping insertion in model container [2019-11-25 08:52:01,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:00" (2/3) ... [2019-11-25 08:52:01,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e72321e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:01, skipping insertion in model container [2019-11-25 08:52:01,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:01" (3/3) ... [2019-11-25 08:52:01,507 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-25 08:52:01,516 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:01,522 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-25 08:52:01,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-25 08:52:01,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:01,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:01,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:01,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:01,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:01,558 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:01,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:01,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-25 08:52:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:52:01,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:01,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-25 08:52:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237432876] [2019-11-25 08:52:01,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,753 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-25 08:52:01,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237432876] [2019-11-25 08:52:01,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:01,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881814736] [2019-11-25 08:52:01,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:01,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,776 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-25 08:52:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,823 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-25 08:52:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:01,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-25 08:52:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:01,836 INFO L225 Difference]: With dead ends: 88 [2019-11-25 08:52:01,837 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 08:52:01,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 08:52:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-25 08:52:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 08:52:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-25 08:52:01,881 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-25 08:52:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:01,881 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-25 08:52:01,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-25 08:52:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:52:01,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:01,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-25 08:52:01,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149379840] [2019-11-25 08:52:01,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,954 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-25 08:52:01,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149379840] [2019-11-25 08:52:01,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:52:01,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126176888] [2019-11-25 08:52:01,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:01,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:01,957 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-25 08:52:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,110 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-25 08:52:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:02,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-25 08:52:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,112 INFO L225 Difference]: With dead ends: 76 [2019-11-25 08:52:02,112 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:52:02,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:52:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:52:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:52:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-25 08:52:02,121 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-25 08:52:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,122 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-25 08:52:02,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-25 08:52:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:52:02,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:02,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-25 08:52:02,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361755592] [2019-11-25 08:52:02,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,179 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-25 08:52:02,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361755592] [2019-11-25 08:52:02,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:02,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184417559] [2019-11-25 08:52:02,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:02,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:02,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:02,181 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-25 08:52:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,278 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-25 08:52:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:02,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 08:52:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,279 INFO L225 Difference]: With dead ends: 97 [2019-11-25 08:52:02,280 INFO L226 Difference]: Without dead ends: 95 [2019-11-25 08:52:02,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-25 08:52:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-25 08:52:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:52:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-25 08:52:02,287 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-25 08:52:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,288 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-25 08:52:02,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-25 08:52:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:52:02,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:02,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-25 08:52:02,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063610576] [2019-11-25 08:52:02,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,341 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-25 08:52:02,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063610576] [2019-11-25 08:52:02,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:02,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508861146] [2019-11-25 08:52:02,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:02,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:02,343 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-25 08:52:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,448 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-25 08:52:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:02,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 08:52:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,450 INFO L225 Difference]: With dead ends: 72 [2019-11-25 08:52:02,450 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 08:52:02,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 08:52:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 08:52:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 08:52:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-25 08:52:02,459 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-25 08:52:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,459 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-25 08:52:02,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-25 08:52:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:02,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,460 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] [2019-11-25 08:52:02,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-25 08:52:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367826797] [2019-11-25 08:52:02,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,541 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-25 08:52:02,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367826797] [2019-11-25 08:52:02,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:02,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369079292] [2019-11-25 08:52:02,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:02,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:02,543 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-25 08:52:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,759 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-25 08:52:02,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:02,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 08:52:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,761 INFO L225 Difference]: With dead ends: 137 [2019-11-25 08:52:02,761 INFO L226 Difference]: Without dead ends: 135 [2019-11-25 08:52:02,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-25 08:52:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-25 08:52:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:52:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-25 08:52:02,781 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-25 08:52:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,781 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-25 08:52:02,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-25 08:52:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:02,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,782 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] [2019-11-25 08:52:02,783 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-25 08:52:02,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077963349] [2019-11-25 08:52:02,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,848 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-25 08:52:02,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077963349] [2019-11-25 08:52:02,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:02,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692907726] [2019-11-25 08:52:02,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:02,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:02,851 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-25 08:52:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,028 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-25 08:52:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:03,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 08:52:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,031 INFO L225 Difference]: With dead ends: 104 [2019-11-25 08:52:03,031 INFO L226 Difference]: Without dead ends: 102 [2019-11-25 08:52:03,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-25 08:52:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-25 08:52:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 08:52:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-25 08:52:03,041 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-25 08:52:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,042 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-25 08:52:03,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-25 08:52:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:03,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,043 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] [2019-11-25 08:52:03,043 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-25 08:52:03,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017858596] [2019-11-25 08:52:03,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,116 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-25 08:52:03,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017858596] [2019-11-25 08:52:03,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:03,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:03,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090281278] [2019-11-25 08:52:03,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:03,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:03,118 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-25 08:52:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,265 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-25 08:52:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:03,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-25 08:52:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,267 INFO L225 Difference]: With dead ends: 117 [2019-11-25 08:52:03,267 INFO L226 Difference]: Without dead ends: 115 [2019-11-25 08:52:03,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-25 08:52:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-25 08:52:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:52:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-25 08:52:03,276 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-25 08:52:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,276 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-25 08:52:03,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-25 08:52:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:03,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,278 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] [2019-11-25 08:52:03,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-25 08:52:03,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794789131] [2019-11-25 08:52:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,342 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-25 08:52:03,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794789131] [2019-11-25 08:52:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:03,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451110194] [2019-11-25 08:52:03,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:03,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:03,344 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-25 08:52:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,460 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-25 08:52:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:03,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-25 08:52:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,462 INFO L225 Difference]: With dead ends: 73 [2019-11-25 08:52:03,462 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 08:52:03,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 08:52:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-25 08:52:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 08:52:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-25 08:52:03,469 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-25 08:52:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,469 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-25 08:52:03,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-25 08:52:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:03,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,471 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] [2019-11-25 08:52:03,471 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-25 08:52:03,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709051398] [2019-11-25 08:52:03,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,512 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-25 08:52:03,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709051398] [2019-11-25 08:52:03,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:03,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:03,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406509144] [2019-11-25 08:52:03,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:03,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:03,514 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-25 08:52:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,567 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-25 08:52:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:03,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:52:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,568 INFO L225 Difference]: With dead ends: 111 [2019-11-25 08:52:03,568 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 08:52:03,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 08:52:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-25 08:52:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 08:52:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-25 08:52:03,575 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-25 08:52:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,575 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-25 08:52:03,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-25 08:52:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:52:03,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,583 INFO L410 BasicCegarLoop]: trace histogram [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-25 08:52:03,583 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-25 08:52:03,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181666219] [2019-11-25 08:52:03,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:52:03,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181666219] [2019-11-25 08:52:03,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461185286] [2019-11-25 08:52:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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-25 08:52:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:52:03,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:52:03,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:03,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-25 08:52:03,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849443446] [2019-11-25 08:52:03,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:52:03,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:52:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:03,812 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-25 08:52:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,952 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-25 08:52:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:03,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-25 08:52:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,953 INFO L225 Difference]: With dead ends: 111 [2019-11-25 08:52:03,953 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 08:52:03,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 08:52:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-25 08:52:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:52:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-25 08:52:03,959 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-25 08:52:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,959 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-25 08:52:03,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:52:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-25 08:52:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:52:03,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,960 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] [2019-11-25 08:52:04,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:04,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-25 08:52:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172690272] [2019-11-25 08:52:04,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,216 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-25 08:52:04,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172690272] [2019-11-25 08:52:04,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:04,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:04,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037280579] [2019-11-25 08:52:04,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:04,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:04,218 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-25 08:52:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:04,289 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-25 08:52:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:04,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 08:52:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:04,291 INFO L225 Difference]: With dead ends: 69 [2019-11-25 08:52:04,291 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 08:52:04,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 08:52:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-25 08:52:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:52:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-25 08:52:04,303 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-25 08:52:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:04,304 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-25 08:52:04,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-25 08:52:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:52:04,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:04,308 INFO L410 BasicCegarLoop]: trace histogram [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-25 08:52:04,308 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-25 08:52:04,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816303908] [2019-11-25 08:52:04,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:52:04,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816303908] [2019-11-25 08:52:04,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755479134] [2019-11-25 08:52:04,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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-25 08:52:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:52:04,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:04,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:52:04,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:04,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-25 08:52:04,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749745058] [2019-11-25 08:52:04,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:52:04,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:52:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:04,460 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-25 08:52:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:04,572 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-25 08:52:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:04,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 08:52:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:04,574 INFO L225 Difference]: With dead ends: 67 [2019-11-25 08:52:04,574 INFO L226 Difference]: Without dead ends: 65 [2019-11-25 08:52:04,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-25 08:52:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-25 08:52:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:52:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 08:52:04,578 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-25 08:52:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:04,578 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 08:52:04,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:52:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 08:52:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:52:04,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:04,603 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] [2019-11-25 08:52:04,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:04,806 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-25 08:52:04,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483122674] [2019-11-25 08:52:04,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,856 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-25 08:52:04,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483122674] [2019-11-25 08:52:04,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:04,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:04,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399896017] [2019-11-25 08:52:04,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:04,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:04,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:04,858 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-25 08:52:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:04,929 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-25 08:52:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:04,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-25 08:52:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:04,930 INFO L225 Difference]: With dead ends: 60 [2019-11-25 08:52:04,930 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:52:04,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:52:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-25 08:52:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 08:52:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-25 08:52:04,934 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-25 08:52:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:04,935 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-25 08:52:04,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-25 08:52:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:52:04,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:04,936 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] [2019-11-25 08:52:04,936 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-25 08:52:04,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855725146] [2019-11-25 08:52:04,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,009 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-25 08:52:05,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855725146] [2019-11-25 08:52:05,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957686463] [2019-11-25 08:52:05,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,011 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-25 08:52:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,080 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-25 08:52:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:05,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-25 08:52:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,081 INFO L225 Difference]: With dead ends: 59 [2019-11-25 08:52:05,081 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 08:52:05,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 08:52:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-25 08:52:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 08:52:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-25 08:52:05,084 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-25 08:52:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,084 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-25 08:52:05,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-25 08:52:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:52:05,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,084 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] [2019-11-25 08:52:05,085 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-25 08:52:05,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370166262] [2019-11-25 08:52:05,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,136 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-25 08:52:05,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370166262] [2019-11-25 08:52:05,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:52:05,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732666413] [2019-11-25 08:52:05,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:05,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:05,138 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-25 08:52:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,236 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-25 08:52:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:05,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-25 08:52:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,237 INFO L225 Difference]: With dead ends: 67 [2019-11-25 08:52:05,237 INFO L226 Difference]: Without dead ends: 65 [2019-11-25 08:52:05,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-25 08:52:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-25 08:52:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 08:52:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-25 08:52:05,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-25 08:52:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,242 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-25 08:52:05,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-25 08:52:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:52:05,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:05,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-25 08:52:05,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554275639] [2019-11-25 08:52:05,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,312 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-25 08:52:05,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554275639] [2019-11-25 08:52:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917973352] [2019-11-25 08:52:05,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,314 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-25 08:52:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,445 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-25 08:52:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:05,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-25 08:52:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,447 INFO L225 Difference]: With dead ends: 87 [2019-11-25 08:52:05,447 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 08:52:05,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 08:52:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-25 08:52:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 08:52:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-25 08:52:05,451 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-25 08:52:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,451 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-25 08:52:05,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-25 08:52:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:52:05,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,452 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-25 08:52:05,452 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-25 08:52:05,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919166529] [2019-11-25 08:52:05,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,530 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-25 08:52:05,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919166529] [2019-11-25 08:52:05,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41618245] [2019-11-25 08:52:05,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,531 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-25 08:52:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,600 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-25 08:52:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:05,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-25 08:52:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,601 INFO L225 Difference]: With dead ends: 57 [2019-11-25 08:52:05,601 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 08:52:05,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 08:52:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-25 08:52:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 08:52:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-25 08:52:05,607 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-25 08:52:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,607 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-25 08:52:05,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-25 08:52:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:52:05,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:05,608 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-25 08:52:05,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436703931] [2019-11-25 08:52:05,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,672 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-25 08:52:05,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436703931] [2019-11-25 08:52:05,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086295423] [2019-11-25 08:52:05,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,674 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-25 08:52:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,699 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-25 08:52:05,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:05,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-25 08:52:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,700 INFO L225 Difference]: With dead ends: 66 [2019-11-25 08:52:05,700 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 08:52:05,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 08:52:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 08:52:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 08:52:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-25 08:52:05,705 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-25 08:52:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,706 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-25 08:52:05,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-25 08:52:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:52:05,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:05,707 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-25 08:52:05,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729503156] [2019-11-25 08:52:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,752 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-25 08:52:05,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729503156] [2019-11-25 08:52:05,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739300312] [2019-11-25 08:52:05,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,754 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-25 08:52:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,786 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 08:52:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:05,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-25 08:52:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,787 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:52:05,787 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 08:52:05,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 08:52:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-25 08:52:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:52:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 08:52:05,792 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-25 08:52:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,792 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 08:52:05,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 08:52:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:52:05,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:05,793 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-25 08:52:05,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814584243] [2019-11-25 08:52:05,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,837 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-25 08:52:05,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814584243] [2019-11-25 08:52:05,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:05,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586233973] [2019-11-25 08:52:05,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:05,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:05,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:05,839 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-25 08:52:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,965 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-25 08:52:05,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:05,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-25 08:52:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,966 INFO L225 Difference]: With dead ends: 86 [2019-11-25 08:52:05,966 INFO L226 Difference]: Without dead ends: 84 [2019-11-25 08:52:05,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-25 08:52:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-25 08:52:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 08:52:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-25 08:52:05,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-25 08:52:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-25 08:52:05,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-25 08:52:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:52:05,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:05,973 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-25 08:52:05,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030575055] [2019-11-25 08:52:05,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:06,044 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-25 08:52:06,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030575055] [2019-11-25 08:52:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:06,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:06,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113169849] [2019-11-25 08:52:06,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:06,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:06,045 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-25 08:52:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:06,144 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-25 08:52:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:06,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-25 08:52:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:06,145 INFO L225 Difference]: With dead ends: 71 [2019-11-25 08:52:06,146 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 08:52:06,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 08:52:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-25 08:52:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 08:52:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-25 08:52:06,150 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-25 08:52:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:06,151 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-25 08:52:06,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-25 08:52:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:52:06,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:06,151 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:06,153 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-25 08:52:06,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:06,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213199551] [2019-11-25 08:52:06,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:06,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213199551] [2019-11-25 08:52:06,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232395608] [2019-11-25 08:52:06,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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-25 08:52:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:06,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:52:06,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:06,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:06,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-25 08:52:06,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041988766] [2019-11-25 08:52:06,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:06,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:06,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:06,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:06,351 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-25 08:52:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:06,516 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-25 08:52:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:52:06,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-25 08:52:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:06,518 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:52:06,518 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 08:52:06,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:52:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 08:52:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-25 08:52:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:52:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-25 08:52:06,523 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-25 08:52:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:06,523 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-25 08:52:06,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-25 08:52:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:06,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:06,524 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:06,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:06,728 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-25 08:52:06,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:06,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354299621] [2019-11-25 08:52:06,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:52:06,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354299621] [2019-11-25 08:52:06,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:06,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:06,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944637467] [2019-11-25 08:52:06,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:06,798 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-25 08:52:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:06,937 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-25 08:52:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:52:06,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-25 08:52:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:06,938 INFO L225 Difference]: With dead ends: 73 [2019-11-25 08:52:06,939 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 08:52:06,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 08:52:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-25 08:52:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 08:52:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-25 08:52:06,943 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-25 08:52:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:06,943 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-25 08:52:06,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-25 08:52:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 08:52:06,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:06,944 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:52:06,944 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-25 08:52:06,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:06,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977156686] [2019-11-25 08:52:06,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:07,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977156686] [2019-11-25 08:52:07,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301882240] [2019-11-25 08:52:07,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/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-25 08:52:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:07,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:52:07,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:52:07,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:52:07,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-25 08:52:07,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102890279] [2019-11-25 08:52:07,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:07,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:07,105 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-25 08:52:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:07,156 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-25 08:52:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:07,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-25 08:52:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:07,157 INFO L225 Difference]: With dead ends: 56 [2019-11-25 08:52:07,157 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:07,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:52:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:07,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-25 08:52:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:07,158 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:07,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:07,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:07,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:07,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:52:07,751 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-25 08:52:08,221 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-25 08:52:08,466 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-25 08:52:08,848 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-25 08:52:08,851 INFO L444 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-25 08:52:08,851 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-25 08:52:08,852 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-25 08:52:08,853 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L440 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L440 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-25 08:52:08,854 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L440 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-25 08:52:08,855 INFO L444 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L440 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse12 (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse15 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) .cse9 .cse10 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L447 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-25 08:52:08,856 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L440 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse3 .cse4 .cse5 .cse6 .cse7)))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)))) [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-25 08:52:08,857 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-25 08:52:08,858 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-25 08:52:08,858 INFO L444 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-25 08:52:08,858 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-25 08:52:08,858 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-25 08:52:08,858 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-25 08:52:08,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:08 BoogieIcfgContainer [2019-11-25 08:52:08,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:08,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:08,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:08,905 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:08,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:01" (3/4) ... [2019-11-25 08:52:08,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:08,930 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:52:08,931 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:52:08,998 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d10b5006-5335-40f2-8109-c327d616a656/bin/uautomizer/witness.graphml [2019-11-25 08:52:08,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:08,999 INFO L168 Benchmark]: Toolchain (without parser) took 8474.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 132.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:09,000 INFO L168 Benchmark]: CDTParser took 0.52 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-25 08:52:09,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:09,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:09,001 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:09,001 INFO L168 Benchmark]: RCFGBuilder took 509.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:09,001 INFO L168 Benchmark]: TraceAbstraction took 7403.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.3 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:09,002 INFO L168 Benchmark]: Witness Printer took 93.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:09,003 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.52 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 388.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 509.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7403.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.3 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. * Witness Printer took 93.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((main__cp + 1 == main__urilen && main__cp < main__urilen) && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || (((main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || (((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && main__cp + 2 <= main__urilen) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 513 HoareAnnotationTreeSize, 6 FomulaSimplifications, 56097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4363 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 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...