./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:10,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:10,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:10,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:10,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:10,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:10,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:10,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:10,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:10,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:10,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:10,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:10,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:10,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:10,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:10,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:10,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:10,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:10,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:10,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:10,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:10,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:10,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:10,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:10,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:10,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:10,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:10,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:10,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:10,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:10,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:10,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:10,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:10,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:10,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:10,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:10,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:10,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:10,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:10,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:10,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:10,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:10,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:10,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:10,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:10,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:10,625 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:10,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:10,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:10,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:10,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:10,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:10,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:10,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:10,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:10,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:10,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:10,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:10,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:10,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:10,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:10,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:10,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:10,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:10,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:10,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:10,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:10,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:10,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:10,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:10,631 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/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-10-22 09:02:10,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:10,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:10,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:10,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:10,670 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:10,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-22 09:02:10,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/data/8a74ffa0c/a8c8aba54de54f4ab5f13a742a642d93/FLAGed142c102 [2019-10-22 09:02:11,125 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:11,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-22 09:02:11,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/data/8a74ffa0c/a8c8aba54de54f4ab5f13a742a642d93/FLAGed142c102 [2019-10-22 09:02:11,147 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/data/8a74ffa0c/a8c8aba54de54f4ab5f13a742a642d93 [2019-10-22 09:02:11,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:11,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:11,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:11,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:11,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:11,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f3d970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,167 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:11,195 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:11,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:11,444 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:11,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:11,494 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:11,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11 WrapperNode [2019-10-22 09:02:11,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:11,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:11,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:11,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:11,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:11,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:11,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:11,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:11,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... [2019-10-22 09:02:11,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:11,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:11,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:11,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:11,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/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-10-22 09:02:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:11,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:11,954 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 09:02:11,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11 BoogieIcfgContainer [2019-10-22 09:02:11,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:11,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:11,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:11,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:11,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:11" (1/3) ... [2019-10-22 09:02:11,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489c250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:11" (2/3) ... [2019-10-22 09:02:11,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489c250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11" (3/3) ... [2019-10-22 09:02:11,966 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-10-22 09:02:11,974 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:11,980 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-22 09:02:11,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-22 09:02:12,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:12,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:12,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:12,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:12,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:12,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:12,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:12,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-10-22 09:02:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 09:02:12,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-10-22 09:02:12,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42588025] [2019-10-22 09:02:12,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42588025] [2019-10-22 09:02:12,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:12,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137583454] [2019-10-22 09:02:12,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:12,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:12,209 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-10-22 09:02:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,345 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2019-10-22 09:02:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:12,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 09:02:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,357 INFO L225 Difference]: With dead ends: 130 [2019-10-22 09:02:12,357 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 09:02:12,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 09:02:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-10-22 09:02:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 09:02:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-22 09:02:12,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-10-22 09:02:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,400 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-22 09:02:12,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-22 09:02:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 09:02:12,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,401 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-10-22 09:02:12,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971528613] [2019-10-22 09:02:12,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971528613] [2019-10-22 09:02:12,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:12,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354511276] [2019-10-22 09:02:12,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:12,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:12,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:12,450 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-10-22 09:02:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,523 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-22 09:02:12,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:12,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 09:02:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,525 INFO L225 Difference]: With dead ends: 65 [2019-10-22 09:02:12,525 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 09:02:12,526 INFO L600 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-10-22 09:02:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 09:02:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-22 09:02:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 09:02:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-22 09:02:12,539 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-10-22 09:02:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,539 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-22 09:02:12,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-22 09:02:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 09:02:12,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-10-22 09:02:12,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640223934] [2019-10-22 09:02:12,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640223934] [2019-10-22 09:02:12,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:12,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811000770] [2019-10-22 09:02:12,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:12,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:12,594 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-22 09:02:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,662 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-22 09:02:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:12,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 09:02:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,665 INFO L225 Difference]: With dead ends: 69 [2019-10-22 09:02:12,665 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 09:02:12,665 INFO L600 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-10-22 09:02:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 09:02:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-22 09:02:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 09:02:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-22 09:02:12,671 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-10-22 09:02:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,674 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-22 09:02:12,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-22 09:02:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:02:12,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-10-22 09:02:12,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559027255] [2019-10-22 09:02:12,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559027255] [2019-10-22 09:02:12,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:12,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464466920] [2019-10-22 09:02:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:12,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:12,747 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-22 09:02:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,815 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-10-22 09:02:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:12,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 09:02:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,816 INFO L225 Difference]: With dead ends: 66 [2019-10-22 09:02:12,817 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 09:02:12,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 09:02:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-22 09:02:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 09:02:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-22 09:02:12,823 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-10-22 09:02:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:12,824 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-22 09:02:12,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-22 09:02:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:02:12,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:12,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:12,825 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-10-22 09:02:12,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:12,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664026907] [2019-10-22 09:02:12,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:12,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664026907] [2019-10-22 09:02:12,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:12,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:12,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625156872] [2019-10-22 09:02:12,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:12,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:12,873 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-22 09:02:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:12,986 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-22 09:02:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:12,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 09:02:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:12,987 INFO L225 Difference]: With dead ends: 65 [2019-10-22 09:02:12,987 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 09:02:12,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 09:02:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-22 09:02:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-22 09:02:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-10-22 09:02:13,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-10-22 09:02:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,000 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-10-22 09:02:13,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-10-22 09:02:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:02:13,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,001 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-10-22 09:02:13,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064975500] [2019-10-22 09:02:13,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064975500] [2019-10-22 09:02:13,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:13,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824467616] [2019-10-22 09:02:13,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:13,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:13,053 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-10-22 09:02:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,112 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-10-22 09:02:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:13,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:02:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,113 INFO L225 Difference]: With dead ends: 63 [2019-10-22 09:02:13,113 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 09:02:13,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 09:02:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-22 09:02:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 09:02:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-22 09:02:13,119 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-10-22 09:02:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,119 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-22 09:02:13,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-22 09:02:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:02:13,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,120 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,120 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,121 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-10-22 09:02:13,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913160739] [2019-10-22 09:02:13,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913160739] [2019-10-22 09:02:13,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:13,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388922482] [2019-10-22 09:02:13,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:13,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:13,177 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-10-22 09:02:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,273 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-10-22 09:02:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:13,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 09:02:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,275 INFO L225 Difference]: With dead ends: 100 [2019-10-22 09:02:13,275 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 09:02:13,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 09:02:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-10-22 09:02:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 09:02:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-22 09:02:13,282 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-10-22 09:02:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-22 09:02:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-22 09:02:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:02:13,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-10-22 09:02:13,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264121387] [2019-10-22 09:02:13,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264121387] [2019-10-22 09:02:13,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:13,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095703682] [2019-10-22 09:02:13,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:13,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:13,317 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-10-22 09:02:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,383 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-10-22 09:02:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:13,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:02:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,384 INFO L225 Difference]: With dead ends: 57 [2019-10-22 09:02:13,384 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 09:02:13,384 INFO L600 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-10-22 09:02:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 09:02:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-22 09:02:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 09:02:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-22 09:02:13,389 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-10-22 09:02:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,389 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-22 09:02:13,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-22 09:02:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:02:13,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,390 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,390 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-10-22 09:02:13,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914476143] [2019-10-22 09:02:13,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914476143] [2019-10-22 09:02:13,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:13,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971293832] [2019-10-22 09:02:13,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:13,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:13,454 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-10-22 09:02:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,562 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-10-22 09:02:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:13,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 09:02:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,563 INFO L225 Difference]: With dead ends: 91 [2019-10-22 09:02:13,563 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 09:02:13,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-22 09:02:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 09:02:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-10-22 09:02:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 09:02:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-22 09:02:13,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-10-22 09:02:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,569 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-22 09:02:13,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-22 09:02:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:02:13,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-10-22 09:02:13,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837925445] [2019-10-22 09:02:13,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837925445] [2019-10-22 09:02:13,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:13,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291068696] [2019-10-22 09:02:13,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:13,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:13,637 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-10-22 09:02:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,723 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-10-22 09:02:13,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:13,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 09:02:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,724 INFO L225 Difference]: With dead ends: 68 [2019-10-22 09:02:13,724 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 09:02:13,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 09:02:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-10-22 09:02:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 09:02:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-22 09:02:13,733 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-10-22 09:02:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,733 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-22 09:02:13,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-22 09:02:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:02:13,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-10-22 09:02:13,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435535654] [2019-10-22 09:02:13,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435535654] [2019-10-22 09:02:13,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:13,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497319346] [2019-10-22 09:02:13,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:13,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:13,825 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-10-22 09:02:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,907 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-22 09:02:13,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:13,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 09:02:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,909 INFO L225 Difference]: With dead ends: 49 [2019-10-22 09:02:13,909 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 09:02:13,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 09:02:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-22 09:02:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 09:02:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-22 09:02:13,914 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-10-22 09:02:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-22 09:02:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-22 09:02:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:02:13,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,917 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-10-22 09:02:13,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982697102] [2019-10-22 09:02:13,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982697102] [2019-10-22 09:02:14,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:14,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392061579] [2019-10-22 09:02:14,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:14,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:14,011 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-10-22 09:02:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,087 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-22 09:02:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:14,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 09:02:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,088 INFO L225 Difference]: With dead ends: 46 [2019-10-22 09:02:14,088 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 09:02:14,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-22 09:02:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 09:02:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-10-22 09:02:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 09:02:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-22 09:02:14,092 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-10-22 09:02:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,093 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-22 09:02:14,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-22 09:02:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:02:14,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-10-22 09:02:14,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925611720] [2019-10-22 09:02:14,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925611720] [2019-10-22 09:02:14,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:14,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454141277] [2019-10-22 09:02:14,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:14,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:14,140 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-10-22 09:02:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,219 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-22 09:02:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:14,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 09:02:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,221 INFO L225 Difference]: With dead ends: 57 [2019-10-22 09:02:14,221 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 09:02:14,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 09:02:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-10-22 09:02:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 09:02:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-22 09:02:14,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-10-22 09:02:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,226 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-22 09:02:14,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-22 09:02:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:02:14,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,227 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,227 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-10-22 09:02:14,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434542916] [2019-10-22 09:02:14,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434542916] [2019-10-22 09:02:14,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:14,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065038608] [2019-10-22 09:02:14,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:14,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:14,295 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-10-22 09:02:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,391 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-10-22 09:02:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:14,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-22 09:02:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,392 INFO L225 Difference]: With dead ends: 61 [2019-10-22 09:02:14,392 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 09:02:14,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 09:02:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-10-22 09:02:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 09:02:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 09:02:14,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-10-22 09:02:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,398 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 09:02:14,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-22 09:02:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:02:14,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,403 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-10-22 09:02:14,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400989341] [2019-10-22 09:02:14,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400989341] [2019-10-22 09:02:14,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:14,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213222905] [2019-10-22 09:02:14,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:14,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:14,497 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-10-22 09:02:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,575 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-22 09:02:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:14,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-22 09:02:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,576 INFO L225 Difference]: With dead ends: 37 [2019-10-22 09:02:14,576 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 09:02:14,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 09:02:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 09:02:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 09:02:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-22 09:02:14,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-10-22 09:02:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,580 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-22 09:02:14,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-22 09:02:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:02:14,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,581 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,581 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-10-22 09:02:14,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298530491] [2019-10-22 09:02:14,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298530491] [2019-10-22 09:02:14,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:14,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20670404] [2019-10-22 09:02:14,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:14,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:14,667 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-10-22 09:02:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,750 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-22 09:02:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:14,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-22 09:02:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,751 INFO L225 Difference]: With dead ends: 48 [2019-10-22 09:02:14,751 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 09:02:14,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 09:02:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-10-22 09:02:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 09:02:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-22 09:02:14,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-10-22 09:02:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,754 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 09:02:14,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-22 09:02:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 09:02:14,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,755 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-10-22 09:02:14,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771014803] [2019-10-22 09:02:14,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771014803] [2019-10-22 09:02:14,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:14,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677396252] [2019-10-22 09:02:14,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:14,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:14,788 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-22 09:02:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,884 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-10-22 09:02:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:14,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 09:02:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,886 INFO L225 Difference]: With dead ends: 52 [2019-10-22 09:02:14,887 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 09:02:14,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 09:02:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-10-22 09:02:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 09:02:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-22 09:02:14,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-10-22 09:02:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,891 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 09:02:14,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-22 09:02:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:02:14,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,892 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:14,892 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-10-22 09:02:14,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:14,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999011515] [2019-10-22 09:02:14,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:14,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999011515] [2019-10-22 09:02:14,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:14,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:14,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229968933] [2019-10-22 09:02:14,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:14,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:14,940 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-10-22 09:02:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,991 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-22 09:02:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:14,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 09:02:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,992 INFO L225 Difference]: With dead ends: 33 [2019-10-22 09:02:14,992 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:02:14,992 INFO L600 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-10-22 09:02:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:02:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:02:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:02:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:14,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-22 09:02:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,993 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:14,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:14,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:02:15,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-22 09:02:15,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-10-22 09:02:15,312 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-22 09:02:15,313 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-10-22 09:02:15,313 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-22 09:02:15,313 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-10-22 09:02:15,313 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-10-22 09:02:15,313 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-10-22 09:02:15,313 INFO L446 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-10-22 09:02:15,313 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-10-22 09:02:15,314 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-22 09:02:15,315 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-22 09:02:15,319 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-10-22 09:02:15,320 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:02:15,321 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-10-22 09:02:15,321 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-10-22 09:02:15,321 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-10-22 09:02:15,321 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-10-22 09:02:15,322 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-10-22 09:02:15,322 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-10-22 09:02:15,323 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-22 09:02:15,324 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-10-22 09:02:15,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:15 BoogieIcfgContainer [2019-10-22 09:02:15,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:15,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:15,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:15,347 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:15,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11" (3/4) ... [2019-10-22 09:02:15,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:02:15,369 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:02:15,371 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:02:15,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c334c698-8098-4552-af1c-b12fcceeaa46/bin/uautomizer/witness.graphml [2019-10-22 09:02:15,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:15,480 INFO L168 Benchmark]: Toolchain (without parser) took 4327.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,480 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:15,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,482 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,482 INFO L168 Benchmark]: RCFGBuilder took 393.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,482 INFO L168 Benchmark]: TraceAbstraction took 3389.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,483 INFO L168 Benchmark]: Witness Printer took 131.63 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:15,485 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 393.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3389.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. * Witness Printer took 131.63 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: 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: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: 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: 220]: 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: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 726 SDtfs, 1259 SDslu, 649 SDs, 0 SdLazy, 990 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 58 HoareAnnotationTreeSize, 6 FomulaSimplifications, 79390 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1100 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...