./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.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_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/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 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:00:38,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:38,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:38,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:38,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:38,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:38,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:38,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:38,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:38,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:38,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:38,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:38,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:38,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:38,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:38,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:38,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:38,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:38,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:38,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:38,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:38,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:38,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:38,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:38,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:38,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:38,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:38,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:38,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:38,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:38,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:38,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:38,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:38,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:38,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:38,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:38,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:38,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:38,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:38,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:38,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:38,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:00:38,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:38,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:38,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:38,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:38,743 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:38,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:38,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:38,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:38,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:38,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:38,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:00:38,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:38,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:00:38,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:38,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:38,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:38,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:00:38,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:38,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:38,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:38,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:38,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:38,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:38,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:38,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:00:38,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:38,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:38,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:00:38,747 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_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/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 -> 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e [2019-10-22 09:00:38,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:38,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:38,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:38,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:38,785 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:38,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-22 09:00:38,831 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/data/de14ec331/d3c0b212bc2b4efd830a0c372ffc4456/FLAGc93abf36c [2019-10-22 09:00:39,276 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:39,277 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-22 09:00:39,299 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/data/de14ec331/d3c0b212bc2b4efd830a0c372ffc4456/FLAGc93abf36c [2019-10-22 09:00:39,806 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/data/de14ec331/d3c0b212bc2b4efd830a0c372ffc4456 [2019-10-22 09:00:39,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:39,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:39,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:39,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:39,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:39,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:39" (1/1) ... [2019-10-22 09:00:39,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2682b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:39, skipping insertion in model container [2019-10-22 09:00:39,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:39" (1/1) ... [2019-10-22 09:00:39,826 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:39,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:40,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:40,131 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:40,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:40,219 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:40,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40 WrapperNode [2019-10-22 09:00:40,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:40,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:40,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:40,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:40,228 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:00:40" (1/1) ... [2019-10-22 09:00:40,235 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:00:40" (1/1) ... [2019-10-22 09:00:40,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:40,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:40,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:40,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:40,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... [2019-10-22 09:00:40,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:40,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:40,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:40,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:40,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/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:00:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:40,468 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,475 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,489 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,503 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,508 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,517 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:40,524 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:00:41,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-10-22 09:00:41,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-10-22 09:00:41,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-10-22 09:00:41,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-10-22 09:00:41,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-10-22 09:00:41,097 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-10-22 09:00:41,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-10-22 09:00:41,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-10-22 09:00:41,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-10-22 09:00:41,101 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:41,101 INFO L284 CfgBuilder]: Removed 78 assume(true) statements. [2019-10-22 09:00:41,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41 BoogieIcfgContainer [2019-10-22 09:00:41,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:41,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:41,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:41,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:41,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:39" (1/3) ... [2019-10-22 09:00:41,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279fd8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:41, skipping insertion in model container [2019-10-22 09:00:41,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:40" (2/3) ... [2019-10-22 09:00:41,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279fd8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:41, skipping insertion in model container [2019-10-22 09:00:41,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41" (3/3) ... [2019-10-22 09:00:41,111 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-10-22 09:00:41,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:41,128 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 09:00:41,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 09:00:41,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:41,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:00:41,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:41,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:41,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:41,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:41,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:41,159 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-10-22 09:00:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 09:00:41,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:41,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:41,183 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1311783926, now seen corresponding path program 1 times [2019-10-22 09:00:41,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:41,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229708126] [2019-10-22 09:00:41,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:41,339 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:00:41,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229708126] [2019-10-22 09:00:41,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:41,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:41,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757191493] [2019-10-22 09:00:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:41,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,358 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2019-10-22 09:00:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:41,431 INFO L93 Difference]: Finished difference Result 343 states and 509 transitions. [2019-10-22 09:00:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:41,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 09:00:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:41,444 INFO L225 Difference]: With dead ends: 343 [2019-10-22 09:00:41,444 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 09:00:41,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 09:00:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-10-22 09:00:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:00:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-10-22 09:00:41,489 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 11 [2019-10-22 09:00:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:41,490 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-10-22 09:00:41,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-10-22 09:00:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 09:00:41,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:41,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:41,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash -825827361, now seen corresponding path program 1 times [2019-10-22 09:00:41,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:41,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224781431] [2019-10-22 09:00:41,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:41,544 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:00:41,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224781431] [2019-10-22 09:00:41,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:41,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:41,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173967595] [2019-10-22 09:00:41,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:41,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,547 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 3 states. [2019-10-22 09:00:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:41,692 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2019-10-22 09:00:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:41,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 09:00:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:41,693 INFO L225 Difference]: With dead ends: 251 [2019-10-22 09:00:41,693 INFO L226 Difference]: Without dead ends: 200 [2019-10-22 09:00:41,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-22 09:00:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2019-10-22 09:00:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 09:00:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2019-10-22 09:00:41,724 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 13 [2019-10-22 09:00:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:41,725 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2019-10-22 09:00:41,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2019-10-22 09:00:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:00:41,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:41,725 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:41,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash 169161723, now seen corresponding path program 1 times [2019-10-22 09:00:41,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:41,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492451283] [2019-10-22 09:00:41,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:41,806 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:00:41,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492451283] [2019-10-22 09:00:41,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:41,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:41,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323388777] [2019-10-22 09:00:41,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:41,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,808 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand 3 states. [2019-10-22 09:00:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:41,840 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2019-10-22 09:00:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:41,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 09:00:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:41,843 INFO L225 Difference]: With dead ends: 297 [2019-10-22 09:00:41,843 INFO L226 Difference]: Without dead ends: 214 [2019-10-22 09:00:41,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-22 09:00:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2019-10-22 09:00:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 09:00:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2019-10-22 09:00:41,858 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 14 [2019-10-22 09:00:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:41,858 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2019-10-22 09:00:41,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2019-10-22 09:00:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 09:00:41,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:41,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:41,860 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:41,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1790313284, now seen corresponding path program 1 times [2019-10-22 09:00:41,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:41,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110342123] [2019-10-22 09:00:41,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:41,927 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:00:41,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110342123] [2019-10-22 09:00:41,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:41,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:41,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674507003] [2019-10-22 09:00:41,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:41,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:41,928 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand 3 states. [2019-10-22 09:00:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,043 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2019-10-22 09:00:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 09:00:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:42,044 INFO L225 Difference]: With dead ends: 170 [2019-10-22 09:00:42,044 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 09:00:42,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 09:00:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 09:00:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 09:00:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2019-10-22 09:00:42,064 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 22 [2019-10-22 09:00:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:42,065 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2019-10-22 09:00:42,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2019-10-22 09:00:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:00:42,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:42,066 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:42,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1900059442, now seen corresponding path program 1 times [2019-10-22 09:00:42,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271237319] [2019-10-22 09:00:42,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,159 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:00:42,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271237319] [2019-10-22 09:00:42,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68939112] [2019-10-22 09:00:42,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:42,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,161 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand 3 states. [2019-10-22 09:00:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,244 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2019-10-22 09:00:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:00:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:42,246 INFO L225 Difference]: With dead ends: 208 [2019-10-22 09:00:42,246 INFO L226 Difference]: Without dead ends: 161 [2019-10-22 09:00:42,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-22 09:00:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-10-22 09:00:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-22 09:00:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2019-10-22 09:00:42,262 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 25 [2019-10-22 09:00:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:42,262 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2019-10-22 09:00:42,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2019-10-22 09:00:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:00:42,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:42,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:42,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash 88593490, now seen corresponding path program 1 times [2019-10-22 09:00:42,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459702484] [2019-10-22 09:00:42,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,331 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:00:42,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459702484] [2019-10-22 09:00:42,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:42,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953647705] [2019-10-22 09:00:42,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:42,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:42,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,333 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 3 states. [2019-10-22 09:00:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,359 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2019-10-22 09:00:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:42,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:00:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:42,368 INFO L225 Difference]: With dead ends: 220 [2019-10-22 09:00:42,368 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 09:00:42,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 09:00:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2019-10-22 09:00:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-22 09:00:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-10-22 09:00:42,392 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 26 [2019-10-22 09:00:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:42,393 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-10-22 09:00:42,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-10-22 09:00:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:00:42,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:42,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:42,395 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 721476524, now seen corresponding path program 1 times [2019-10-22 09:00:42,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374438763] [2019-10-22 09:00:42,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,466 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:00:42,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374438763] [2019-10-22 09:00:42,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:42,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060226386] [2019-10-22 09:00:42,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:42,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:42,468 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 5 states. [2019-10-22 09:00:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,637 INFO L93 Difference]: Finished difference Result 303 states and 407 transitions. [2019-10-22 09:00:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:42,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 09:00:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:42,640 INFO L225 Difference]: With dead ends: 303 [2019-10-22 09:00:42,640 INFO L226 Difference]: Without dead ends: 253 [2019-10-22 09:00:42,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-22 09:00:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2019-10-22 09:00:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-22 09:00:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-10-22 09:00:42,656 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 29 [2019-10-22 09:00:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:42,656 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-10-22 09:00:42,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-10-22 09:00:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:00:42,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:42,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:42,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash 679460228, now seen corresponding path program 1 times [2019-10-22 09:00:42,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153998419] [2019-10-22 09:00:42,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,704 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:00:42,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153998419] [2019-10-22 09:00:42,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:42,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793980743] [2019-10-22 09:00:42,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:42,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:42,706 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 5 states. [2019-10-22 09:00:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:42,865 INFO L93 Difference]: Finished difference Result 275 states and 365 transitions. [2019-10-22 09:00:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:42,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 09:00:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:42,870 INFO L225 Difference]: With dead ends: 275 [2019-10-22 09:00:42,870 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 09:00:42,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 09:00:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2019-10-22 09:00:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-22 09:00:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 240 transitions. [2019-10-22 09:00:42,883 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 240 transitions. Word has length 29 [2019-10-22 09:00:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:42,884 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 240 transitions. [2019-10-22 09:00:42,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 240 transitions. [2019-10-22 09:00:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:00:42,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:42,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:42,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 883394074, now seen corresponding path program 1 times [2019-10-22 09:00:42,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:42,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778900344] [2019-10-22 09:00:42,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:42,927 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:00:42,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778900344] [2019-10-22 09:00:42,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:42,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:42,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732187701] [2019-10-22 09:00:42,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:42,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:42,928 INFO L87 Difference]: Start difference. First operand 174 states and 240 transitions. Second operand 4 states. [2019-10-22 09:00:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,032 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-10-22 09:00:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:43,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-22 09:00:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,034 INFO L225 Difference]: With dead ends: 218 [2019-10-22 09:00:43,034 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 09:00:43,034 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:00:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 09:00:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-10-22 09:00:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 09:00:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2019-10-22 09:00:43,045 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 30 [2019-10-22 09:00:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,046 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2019-10-22 09:00:43,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2019-10-22 09:00:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:00:43,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,047 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1219124044, now seen corresponding path program 1 times [2019-10-22 09:00:43,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640588232] [2019-10-22 09:00:43,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,077 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:00:43,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640588232] [2019-10-22 09:00:43,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:43,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503151694] [2019-10-22 09:00:43,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:43,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,078 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand 3 states. [2019-10-22 09:00:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,099 INFO L93 Difference]: Finished difference Result 177 states and 244 transitions. [2019-10-22 09:00:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:43,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 09:00:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,100 INFO L225 Difference]: With dead ends: 177 [2019-10-22 09:00:43,100 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 09:00:43,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 09:00:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 09:00:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 09:00:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-22 09:00:43,104 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2019-10-22 09:00:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,104 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-22 09:00:43,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-22 09:00:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:00:43,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,105 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash 358090674, now seen corresponding path program 1 times [2019-10-22 09:00:43,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017112288] [2019-10-22 09:00:43,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,159 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:00:43,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017112288] [2019-10-22 09:00:43,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:43,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790495158] [2019-10-22 09:00:43,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:43,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:43,160 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-10-22 09:00:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,195 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-22 09:00:43,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:43,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 09:00:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,196 INFO L225 Difference]: With dead ends: 69 [2019-10-22 09:00:43,196 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 09:00:43,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 09:00:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-10-22 09:00:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 09:00:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-22 09:00:43,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 32 [2019-10-22 09:00:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,201 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-22 09:00:43,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-22 09:00:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:00:43,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,201 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 316074378, now seen corresponding path program 1 times [2019-10-22 09:00:43,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388340949] [2019-10-22 09:00:43,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,239 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:00:43,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388340949] [2019-10-22 09:00:43,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:43,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533487910] [2019-10-22 09:00:43,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:43,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,240 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 3 states. [2019-10-22 09:00:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,261 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-10-22 09:00:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:43,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 09:00:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,262 INFO L225 Difference]: With dead ends: 65 [2019-10-22 09:00:43,262 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 09:00:43,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 09:00:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 09:00:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 09:00:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-22 09:00:43,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2019-10-22 09:00:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,270 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-22 09:00:43,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-22 09:00:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:00:43,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -493272248, now seen corresponding path program 1 times [2019-10-22 09:00:43,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711305286] [2019-10-22 09:00:43,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,301 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:00:43,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711305286] [2019-10-22 09:00:43,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:43,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891664204] [2019-10-22 09:00:43,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:43,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,303 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-10-22 09:00:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,314 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-10-22 09:00:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:43,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 09:00:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,315 INFO L225 Difference]: With dead ends: 62 [2019-10-22 09:00:43,315 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 09:00:43,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 09:00:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-22 09:00:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 09:00:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-22 09:00:43,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2019-10-22 09:00:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,321 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-22 09:00:43,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-22 09:00:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:00:43,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,322 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1452502264, now seen corresponding path program 1 times [2019-10-22 09:00:43,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874642789] [2019-10-22 09:00:43,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,358 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:00:43,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874642789] [2019-10-22 09:00:43,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:43,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061571800] [2019-10-22 09:00:43,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:43,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,360 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2019-10-22 09:00:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,379 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-10-22 09:00:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:43,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 09:00:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,380 INFO L225 Difference]: With dead ends: 52 [2019-10-22 09:00:43,380 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 09:00:43,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 09:00:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-10-22 09:00:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 09:00:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-22 09:00:43,384 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 32 [2019-10-22 09:00:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,384 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-22 09:00:43,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-22 09:00:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 09:00:43,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,385 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1791632684, now seen corresponding path program 1 times [2019-10-22 09:00:43,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753391686] [2019-10-22 09:00:43,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,454 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:00:43,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753391686] [2019-10-22 09:00:43,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:43,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744103465] [2019-10-22 09:00:43,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:43,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:43,455 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2019-10-22 09:00:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,500 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-10-22 09:00:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:43,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 09:00:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,501 INFO L225 Difference]: With dead ends: 53 [2019-10-22 09:00:43,501 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 09:00:43,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 09:00:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-10-22 09:00:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 09:00:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-10-22 09:00:43,504 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-10-22 09:00:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,505 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-22 09:00:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-10-22 09:00:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 09:00:43,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:43,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1200712151, now seen corresponding path program 1 times [2019-10-22 09:00:43,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72782635] [2019-10-22 09:00:43,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,531 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:00:43,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72782635] [2019-10-22 09:00:43,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:43,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:43,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104223694] [2019-10-22 09:00:43,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:43,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,533 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-10-22 09:00:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,541 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-22 09:00:43,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:43,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 09:00:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:43,542 INFO L225 Difference]: With dead ends: 38 [2019-10-22 09:00:43,542 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:00:43,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:00:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:00:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:00:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:00:43,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-22 09:00:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:43,543 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:43,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:00:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:43,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:00:43,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:00:43,966 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-10-22 09:00:44,439 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,440 INFO L439 ceAbstractionStarter]: At program point L69(lines 322 367) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-10-22 09:00:44,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,441 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,441 INFO L439 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~s~0)) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,441 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2019-10-22 09:00:44,441 INFO L439 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~setEventCalled~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5))) [2019-10-22 09:00:44,441 INFO L439 ceAbstractionStarter]: At program point L470-1(lines 443 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,441 INFO L439 ceAbstractionStarter]: At program point L470-2(lines 443 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L439 ceAbstractionStarter]: At program point L470-3(lines 443 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,442 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-10-22 09:00:44,443 INFO L439 ceAbstractionStarter]: At program point L175-1(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,443 INFO L439 ceAbstractionStarter]: At program point L572(lines 564 574) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 09:00:44,443 INFO L439 ceAbstractionStarter]: At program point L572-1(lines 564 574) the Hoare annotation is: false [2019-10-22 09:00:44,443 INFO L439 ceAbstractionStarter]: At program point L572-2(lines 564 574) the Hoare annotation is: false [2019-10-22 09:00:44,443 INFO L439 ceAbstractionStarter]: At program point L572-3(lines 564 574) the Hoare annotation is: false [2019-10-22 09:00:44,443 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2019-10-22 09:00:44,443 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2019-10-22 09:00:44,443 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,443 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L439 ceAbstractionStarter]: At program point L540-1(lines 540 544) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L439 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2019-10-22 09:00:44,444 INFO L439 ceAbstractionStarter]: At program point L47(lines 339 344) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,444 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L439 ceAbstractionStarter]: At program point L444-1(lines 444 447) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L444-2(lines 444 447) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L439 ceAbstractionStarter]: At program point L444-3(lines 444 447) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L444-4(lines 444 447) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L439 ceAbstractionStarter]: At program point L444-5(lines 444 447) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L444-6(lines 444 447) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L439 ceAbstractionStarter]: At program point L444-7(lines 444 447) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 478 495) no Hoare annotation was computed. [2019-10-22 09:00:44,445 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 495) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L478-3(lines 478 495) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L479-3(lines 479 485) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L479-6(lines 479 485) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L479-9(lines 479 485) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-1(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-2(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-3(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-4(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-5(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-6(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-7(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-8(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-9(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-10(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-11(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,447 INFO L443 ceAbstractionStarter]: For program point L580-12(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L443 ceAbstractionStarter]: For program point L580-13(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L443 ceAbstractionStarter]: For program point L580-14(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L443 ceAbstractionStarter]: For program point L580-15(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L439 ceAbstractionStarter]: At program point L581-3(lines 1 583) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and (or (and .cse0 .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~MPR3~0 ~s~0) .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= ~setEventCalled~0 1)))) [2019-10-22 09:00:44,448 INFO L439 ceAbstractionStarter]: At program point L581-6(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,448 INFO L439 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,448 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:00:44,448 INFO L439 ceAbstractionStarter]: At program point L581-8(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,449 INFO L439 ceAbstractionStarter]: At program point L581-9(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,449 INFO L439 ceAbstractionStarter]: At program point L284(lines 74 286) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,449 INFO L439 ceAbstractionStarter]: At program point L581-11(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,449 INFO L439 ceAbstractionStarter]: At program point L581-12(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2019-10-22 09:00:44,449 INFO L439 ceAbstractionStarter]: At program point L581-14(lines 1 583) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 450 473) no Hoare annotation was computed. [2019-10-22 09:00:44,449 INFO L443 ceAbstractionStarter]: For program point L450-2(lines 450 473) no Hoare annotation was computed. [2019-10-22 09:00:44,450 INFO L446 ceAbstractionStarter]: At program point L384(lines 368 417) the Hoare annotation is: true [2019-10-22 09:00:44,450 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2019-10-22 09:00:44,450 INFO L443 ceAbstractionStarter]: For program point L450-3(lines 450 473) no Hoare annotation was computed. [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L451-1(lines 450 473) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L451-2(lines 450 473) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,450 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,450 INFO L439 ceAbstractionStarter]: At program point L451-3(lines 450 473) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,451 INFO L446 ceAbstractionStarter]: At program point L419(lines 287 421) the Hoare annotation is: true [2019-10-22 09:00:44,451 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-10-22 09:00:44,451 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2019-10-22 09:00:44,451 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2019-10-22 09:00:44,451 INFO L439 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,451 INFO L439 ceAbstractionStarter]: At program point L519(lines 514 521) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 09:00:44,451 INFO L439 ceAbstractionStarter]: At program point L519-1(lines 514 521) the Hoare annotation is: false [2019-10-22 09:00:44,451 INFO L439 ceAbstractionStarter]: At program point L519-2(lines 514 521) the Hoare annotation is: false [2019-10-22 09:00:44,451 INFO L439 ceAbstractionStarter]: At program point L519-3(lines 514 521) the Hoare annotation is: false [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L439 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L487-2(lines 487 494) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L487-4(lines 487 494) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L439 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L487-6(lines 487 494) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2019-10-22 09:00:44,452 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 472) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L455-2(lines 455 472) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L455-3(lines 455 472) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L439 ceAbstractionStarter]: At program point L522(lines 522 563) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,453 INFO L439 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 09:00:44,453 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,453 INFO L439 ceAbstractionStarter]: At program point L456-1(lines 455 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L456-2(lines 455 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L456-3(lines 455 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:00:44,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L458-1(lines 457 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L458-2(lines 457 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L439 ceAbstractionStarter]: At program point L458-3(lines 457 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-10-22 09:00:44,454 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 432) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 426 432) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L426-4(lines 426 432) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L439 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L426-6(lines 426 432) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-22 09:00:44,455 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,455 INFO L439 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L331-2(lines 331 334) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2019-10-22 09:00:44,456 INFO L439 ceAbstractionStarter]: At program point L497(lines 436 499) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and (or (and .cse0 .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~MPR3~0 ~s~0) .cse2 .cse4 (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= ~setEventCalled~0 1)))) [2019-10-22 09:00:44,456 INFO L439 ceAbstractionStarter]: At program point L497-1(lines 436 499) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,456 INFO L439 ceAbstractionStarter]: At program point L497-2(lines 436 499) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,457 INFO L439 ceAbstractionStarter]: At program point L497-3(lines 436 499) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 09:00:44,457 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2019-10-22 09:00:44,457 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2019-10-22 09:00:44,457 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2019-10-22 09:00:44,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:00:44 BoogieIcfgContainer [2019-10-22 09:00:44,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:00:44,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:44,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:44,488 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:44,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:41" (3/4) ... [2019-10-22 09:00:44,492 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:00:44,516 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2019-10-22 09:00:44,517 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-10-22 09:00:44,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 09:00:44,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == \result) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((((0 == status && !(1 == pended)) && returnVal2 == 259) && MPR3 == s) && status == 0) && 1 <= compRegistered) && 259 <= \result) && \result <= 259) && NP + 4 <= MPR1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) [2019-10-22 09:00:44,628 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c15b55d1-8bf8-4df7-8007-4828f8f7cf93/bin/uautomizer/witness.graphml [2019-10-22 09:00:44,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:44,630 INFO L168 Benchmark]: Toolchain (without parser) took 4820.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,630 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:00:44,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,631 INFO L168 Benchmark]: Boogie Preprocessor took 32.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,631 INFO L168 Benchmark]: RCFGBuilder took 788.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,631 INFO L168 Benchmark]: TraceAbstraction took 3384.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.4 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,631 INFO L168 Benchmark]: Witness Printer took 140.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,633 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 409.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 788.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3384.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.4 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. * Witness Printer took 140.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((0 == status && !(1 == pended)) && returnVal2 == 259) && MPR3 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == \result) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((((0 == status && !(1 == pended)) && returnVal2 == 259) && MPR3 == s) && status == 0) && 1 <= compRegistered) && 259 <= \result) && \result <= 259) && NP + 4 <= MPR1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && status == 0) && NP == s) && !(MPR3 == s)) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1) || ((((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: (((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 173 locations, 16 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 2113 SDtfs, 1457 SDslu, 1788 SDs, 0 SdLazy, 533 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=7, 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, 16 MinimizatonAttempts, 221 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 61 PreInvPairs, 131 NumberOfFragments, 1217 HoareAnnotationTreeSize, 61 FomulaSimplifications, 2180 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 61 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 18768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...