./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/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/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 a3956b9d522359ca85af7edde8f84196cd7ca984 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:43:20,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:43:20,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:43:20,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:43:20,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:43:20,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:43:20,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:43:20,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:43:20,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:43:20,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:43:20,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:43:20,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:43:20,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:43:20,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:43:20,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:43:20,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:43:20,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:43:20,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:43:20,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:43:20,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:43:20,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:43:20,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:43:20,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:43:20,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:43:20,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:43:20,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:43:20,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:43:20,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:43:20,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:43:20,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:43:20,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:43:20,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:43:20,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:43:20,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:43:20,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:43:20,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:43:20,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:43:20,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:43:20,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:43:20,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:43:20,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:43:20,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:43:20,342 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:43:20,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:43:20,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:43:20,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:43:20,344 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:43:20,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:43:20,344 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:43:20,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:43:20,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:43:20,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:43:20,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:43:20,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:43:20,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:43:20,345 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:43:20,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:43:20,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:43:20,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:43:20,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:43:20,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:43:20,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:43:20,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:43:20,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:43:20,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:43:20,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:43:20,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:43:20,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:43:20,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:43:20,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:43:20,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/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 -> a3956b9d522359ca85af7edde8f84196cd7ca984 [2019-11-15 21:43:20,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:43:20,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:43:20,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:43:20,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:43:20,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:43:20,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-15 21:43:20,455 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/data/68c3adb2a/c3d86130b0e345db9e62cb00e6af0315/FLAGbb069cfaa [2019-11-15 21:43:20,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:43:20,928 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-15 21:43:20,951 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/data/68c3adb2a/c3d86130b0e345db9e62cb00e6af0315/FLAGbb069cfaa [2019-11-15 21:43:21,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/data/68c3adb2a/c3d86130b0e345db9e62cb00e6af0315 [2019-11-15 21:43:21,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:43:21,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:43:21,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:43:21,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:43:21,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:43:21,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f09ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21, skipping insertion in model container [2019-11-15 21:43:21,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,444 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:43:21,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:43:21,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:21,778 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:43:21,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:21,837 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:43:21,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21 WrapperNode [2019-11-15 21:43:21,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:43:21,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:21,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:43:21,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:43:21,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:21,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:43:21,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:43:21,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:43:21,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... [2019-11-15 21:43:21,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:43:21,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:43:21,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:43:21,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:43:21,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:43:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:43:22,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:43:22,130 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,137 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,148 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,165 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,172 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,191 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,198 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:43:22,753 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-11-15 21:43:22,754 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-11-15 21:43:22,754 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-11-15 21:43:22,754 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-11-15 21:43:22,754 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-11-15 21:43:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-15 21:43:22,756 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-15 21:43:22,756 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-15 21:43:22,756 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-15 21:43:22,757 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:43:22,758 INFO L284 CfgBuilder]: Removed 78 assume(true) statements. [2019-11-15 21:43:22,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:22 BoogieIcfgContainer [2019-11-15 21:43:22,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:43:22,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:43:22,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:43:22,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:43:22,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:43:21" (1/3) ... [2019-11-15 21:43:22,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c23150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:43:22, skipping insertion in model container [2019-11-15 21:43:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:21" (2/3) ... [2019-11-15 21:43:22,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c23150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:43:22, skipping insertion in model container [2019-11-15 21:43:22,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:22" (3/3) ... [2019-11-15 21:43:22,765 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-11-15 21:43:22,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:43:22,780 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-15 21:43:22,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-15 21:43:22,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:43:22,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:43:22,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:43:22,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:43:22,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:43:22,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:43:22,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:43:22,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:43:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-11-15 21:43:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:43:22,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:22,838 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:22,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1311783926, now seen corresponding path program 1 times [2019-11-15 21:43:22,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:22,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336922198] [2019-11-15 21:43:22,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:22,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:22,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:22,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336922198] [2019-11-15 21:43:22,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:22,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:22,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721955549] [2019-11-15 21:43:23,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:23,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:23,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:23,013 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2019-11-15 21:43:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:23,087 INFO L93 Difference]: Finished difference Result 343 states and 509 transitions. [2019-11-15 21:43:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:23,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 21:43:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:23,101 INFO L225 Difference]: With dead ends: 343 [2019-11-15 21:43:23,101 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 21:43:23,104 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-11-15 21:43:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 21:43:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-11-15 21:43:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 21:43:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-11-15 21:43:23,150 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 11 [2019-11-15 21:43:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:23,150 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-11-15 21:43:23,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-11-15 21:43:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:43:23,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:23,151 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:23,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -825827361, now seen corresponding path program 1 times [2019-11-15 21:43:23,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:23,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214091219] [2019-11-15 21:43:23,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:23,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214091219] [2019-11-15 21:43:23,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:23,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:23,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404283598] [2019-11-15 21:43:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:23,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:23,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:23,215 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 3 states. [2019-11-15 21:43:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:23,422 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2019-11-15 21:43:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:23,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-15 21:43:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:23,425 INFO L225 Difference]: With dead ends: 251 [2019-11-15 21:43:23,425 INFO L226 Difference]: Without dead ends: 200 [2019-11-15 21:43:23,426 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-11-15 21:43:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-15 21:43:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2019-11-15 21:43:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 21:43:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2019-11-15 21:43:23,461 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 13 [2019-11-15 21:43:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:23,462 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2019-11-15 21:43:23,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2019-11-15 21:43:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:43:23,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:23,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:23,468 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash 169161723, now seen corresponding path program 1 times [2019-11-15 21:43:23,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:23,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94087859] [2019-11-15 21:43:23,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:23,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94087859] [2019-11-15 21:43:23,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:23,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:23,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076255492] [2019-11-15 21:43:23,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:23,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:23,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:23,569 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand 3 states. [2019-11-15 21:43:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:23,605 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2019-11-15 21:43:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:23,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-15 21:43:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:23,614 INFO L225 Difference]: With dead ends: 297 [2019-11-15 21:43:23,614 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 21:43:23,617 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-11-15 21:43:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 21:43:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2019-11-15 21:43:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 21:43:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2019-11-15 21:43:23,645 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 14 [2019-11-15 21:43:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:23,646 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2019-11-15 21:43:23,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2019-11-15 21:43:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:43:23,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:23,649 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-11-15 21:43:23,651 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1790313284, now seen corresponding path program 1 times [2019-11-15 21:43:23,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:23,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955291294] [2019-11-15 21:43:23,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:23,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955291294] [2019-11-15 21:43:23,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:23,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:23,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733691070] [2019-11-15 21:43:23,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:23,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:23,743 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand 3 states. [2019-11-15 21:43:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:23,846 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2019-11-15 21:43:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:23,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 21:43:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:23,848 INFO L225 Difference]: With dead ends: 170 [2019-11-15 21:43:23,848 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:43:23,848 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-11-15 21:43:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:43:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-15 21:43:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 21:43:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2019-11-15 21:43:23,866 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 22 [2019-11-15 21:43:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:23,866 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2019-11-15 21:43:23,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2019-11-15 21:43:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:43:23,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:23,876 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-11-15 21:43:23,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1900059442, now seen corresponding path program 1 times [2019-11-15 21:43:23,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:23,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486825341] [2019-11-15 21:43:23,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:23,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:23,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486825341] [2019-11-15 21:43:23,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:23,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:23,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770354429] [2019-11-15 21:43:23,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:23,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:23,920 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand 3 states. [2019-11-15 21:43:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:23,998 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2019-11-15 21:43:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:23,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 21:43:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,000 INFO L225 Difference]: With dead ends: 208 [2019-11-15 21:43:24,000 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:43:24,001 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-11-15 21:43:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:43:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-15 21:43:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 21:43:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2019-11-15 21:43:24,012 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 25 [2019-11-15 21:43:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,012 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2019-11-15 21:43:24,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2019-11-15 21:43:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:43:24,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,014 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-11-15 21:43:24,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 88593490, now seen corresponding path program 1 times [2019-11-15 21:43:24,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033820377] [2019-11-15 21:43:24,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033820377] [2019-11-15 21:43:24,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:24,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668915590] [2019-11-15 21:43:24,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:24,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:24,054 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 3 states. [2019-11-15 21:43:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:24,085 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2019-11-15 21:43:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:24,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:43:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,090 INFO L225 Difference]: With dead ends: 220 [2019-11-15 21:43:24,090 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:43:24,092 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-11-15 21:43:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:43:24,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2019-11-15 21:43:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 21:43:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-15 21:43:24,104 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 26 [2019-11-15 21:43:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,105 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-15 21:43:24,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-15 21:43:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:43:24,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,106 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-11-15 21:43:24,107 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash 721476524, now seen corresponding path program 1 times [2019-11-15 21:43:24,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374236771] [2019-11-15 21:43:24,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374236771] [2019-11-15 21:43:24,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:24,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587830123] [2019-11-15 21:43:24,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:43:24,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:24,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:24,219 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 5 states. [2019-11-15 21:43:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:24,382 INFO L93 Difference]: Finished difference Result 303 states and 407 transitions. [2019-11-15 21:43:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:24,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 21:43:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,385 INFO L225 Difference]: With dead ends: 303 [2019-11-15 21:43:24,385 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 21:43:24,386 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-11-15 21:43:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 21:43:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2019-11-15 21:43:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-15 21:43:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-15 21:43:24,401 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 29 [2019-11-15 21:43:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,401 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-15 21:43:24,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:43:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-15 21:43:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:43:24,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,403 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-11-15 21:43:24,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 679460228, now seen corresponding path program 1 times [2019-11-15 21:43:24,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614407429] [2019-11-15 21:43:24,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614407429] [2019-11-15 21:43:24,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:24,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861939853] [2019-11-15 21:43:24,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:43:24,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:24,459 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 5 states. [2019-11-15 21:43:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:24,628 INFO L93 Difference]: Finished difference Result 275 states and 365 transitions. [2019-11-15 21:43:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:24,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 21:43:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,632 INFO L225 Difference]: With dead ends: 275 [2019-11-15 21:43:24,632 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 21:43:24,633 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-11-15 21:43:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 21:43:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2019-11-15 21:43:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 21:43:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 240 transitions. [2019-11-15 21:43:24,651 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 240 transitions. Word has length 29 [2019-11-15 21:43:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,652 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 240 transitions. [2019-11-15 21:43:24,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:43:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 240 transitions. [2019-11-15 21:43:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:43:24,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,654 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-11-15 21:43:24,655 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 883394074, now seen corresponding path program 1 times [2019-11-15 21:43:24,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399641903] [2019-11-15 21:43:24,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399641903] [2019-11-15 21:43:24,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:24,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540742866] [2019-11-15 21:43:24,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:43:24,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:43:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:43:24,714 INFO L87 Difference]: Start difference. First operand 174 states and 240 transitions. Second operand 4 states. [2019-11-15 21:43:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:24,828 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-11-15 21:43:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:43:24,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-15 21:43:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,830 INFO L225 Difference]: With dead ends: 218 [2019-11-15 21:43:24,831 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 21:43:24,831 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-11-15 21:43:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 21:43:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-11-15 21:43:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 21:43:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2019-11-15 21:43:24,849 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 30 [2019-11-15 21:43:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,849 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2019-11-15 21:43:24,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:43:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2019-11-15 21:43:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:43:24,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,851 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-11-15 21:43:24,851 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1219124044, now seen corresponding path program 1 times [2019-11-15 21:43:24,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107803247] [2019-11-15 21:43:24,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107803247] [2019-11-15 21:43:24,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:24,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735398927] [2019-11-15 21:43:24,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:24,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:24,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:24,888 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand 3 states. [2019-11-15 21:43:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:24,907 INFO L93 Difference]: Finished difference Result 177 states and 244 transitions. [2019-11-15 21:43:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:24,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:43:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:24,909 INFO L225 Difference]: With dead ends: 177 [2019-11-15 21:43:24,909 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 21:43:24,909 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-11-15 21:43:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 21:43:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-15 21:43:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 21:43:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-15 21:43:24,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2019-11-15 21:43:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-15 21:43:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-15 21:43:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:43:24,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:24,916 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-11-15 21:43:24,917 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 358090674, now seen corresponding path program 1 times [2019-11-15 21:43:24,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:24,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296963707] [2019-11-15 21:43:24,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:24,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:24,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296963707] [2019-11-15 21:43:24,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:24,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:24,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863459854] [2019-11-15 21:43:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:43:24,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:24,979 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-11-15 21:43:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,017 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-15 21:43:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:25,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 21:43:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,018 INFO L225 Difference]: With dead ends: 69 [2019-11-15 21:43:25,018 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 21:43:25,019 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-11-15 21:43:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 21:43:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-11-15 21:43:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 21:43:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-15 21:43:25,022 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 32 [2019-11-15 21:43:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,023 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-15 21:43:25,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:43:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-15 21:43:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:43:25,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:25,024 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-11-15 21:43:25,025 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 316074378, now seen corresponding path program 1 times [2019-11-15 21:43:25,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:25,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517291046] [2019-11-15 21:43:25,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:25,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517291046] [2019-11-15 21:43:25,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:25,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:25,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745016981] [2019-11-15 21:43:25,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:25,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:25,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:25,060 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 3 states. [2019-11-15 21:43:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,089 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-11-15 21:43:25,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:25,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 21:43:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,091 INFO L225 Difference]: With dead ends: 65 [2019-11-15 21:43:25,091 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 21:43:25,091 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-11-15 21:43:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 21:43:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-15 21:43:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 21:43:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-15 21:43:25,094 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2019-11-15 21:43:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,095 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-15 21:43:25,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-15 21:43:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:43:25,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:25,095 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-11-15 21:43:25,096 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash -493272248, now seen corresponding path program 1 times [2019-11-15 21:43:25,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:25,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198741826] [2019-11-15 21:43:25,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:25,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198741826] [2019-11-15 21:43:25,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:25,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:25,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204966392] [2019-11-15 21:43:25,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:25,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:25,126 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-15 21:43:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,141 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-15 21:43:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:25,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 21:43:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,142 INFO L225 Difference]: With dead ends: 62 [2019-11-15 21:43:25,142 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 21:43:25,143 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-11-15 21:43:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 21:43:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-11-15 21:43:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 21:43:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-15 21:43:25,146 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2019-11-15 21:43:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,146 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-15 21:43:25,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-15 21:43:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:43:25,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:25,147 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-11-15 21:43:25,147 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1452502264, now seen corresponding path program 1 times [2019-11-15 21:43:25,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:25,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710734281] [2019-11-15 21:43:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:25,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710734281] [2019-11-15 21:43:25,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:25,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:25,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242055922] [2019-11-15 21:43:25,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:25,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:25,176 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2019-11-15 21:43:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,192 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-15 21:43:25,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:25,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 21:43:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,193 INFO L225 Difference]: With dead ends: 52 [2019-11-15 21:43:25,193 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 21:43:25,193 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-11-15 21:43:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 21:43:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-11-15 21:43:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 21:43:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-15 21:43:25,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 32 [2019-11-15 21:43:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,196 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-15 21:43:25,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-15 21:43:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:43:25,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:25,196 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-11-15 21:43:25,197 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1791632684, now seen corresponding path program 1 times [2019-11-15 21:43:25,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:25,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724752846] [2019-11-15 21:43:25,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:25,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724752846] [2019-11-15 21:43:25,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:25,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:43:25,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553837984] [2019-11-15 21:43:25,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:43:25,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:25,269 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2019-11-15 21:43:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,312 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-15 21:43:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:43:25,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 21:43:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,313 INFO L225 Difference]: With dead ends: 53 [2019-11-15 21:43:25,313 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 21:43:25,314 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-11-15 21:43:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 21:43:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-15 21:43:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 21:43:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-15 21:43:25,317 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-11-15 21:43:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,317 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-15 21:43:25,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:43:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-15 21:43:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:43:25,317 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:43:25,318 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-11-15 21:43:25,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:43:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1200712151, now seen corresponding path program 1 times [2019-11-15 21:43:25,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:25,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409206906] [2019-11-15 21:43:25,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:25,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:25,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409206906] [2019-11-15 21:43:25,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:25,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:43:25,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199480131] [2019-11-15 21:43:25,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:43:25,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:43:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:43:25,350 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-11-15 21:43:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:25,359 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-15 21:43:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:43:25,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 21:43:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:43:25,360 INFO L225 Difference]: With dead ends: 38 [2019-11-15 21:43:25,360 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:43:25,360 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-11-15 21:43:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:43:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:43:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:43:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:43:25,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-15 21:43:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:43:25,361 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:43:25,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:43:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:43:25,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:43:25,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:43:26,254 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-15 21:43:26,433 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-15 21:43:26,462 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,462 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 181) no Hoare annotation was computed. [2019-11-15 21:43:26,462 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 270) no Hoare annotation was computed. [2019-11-15 21:43:26,463 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 281) no Hoare annotation was computed. [2019-11-15 21:43:26,463 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-15 21:43:26,463 INFO L439 ceAbstractionStarter]: At program point L104(lines 103 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-11-15 21:43:26,463 INFO L439 ceAbstractionStarter]: At program point L534(lines 526 545) 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-11-15 21:43:26,463 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 410) no Hoare annotation was computed. [2019-11-15 21:43:26,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L439 ceAbstractionStarter]: At program point L469(lines 442 497) 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-11-15 21:43:26,464 INFO L439 ceAbstractionStarter]: At program point L469-1(lines 442 497) 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-11-15 21:43:26,464 INFO L439 ceAbstractionStarter]: At program point L469-2(lines 442 497) 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-11-15 21:43:26,464 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L439 ceAbstractionStarter]: At program point L469-3(lines 442 497) 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-11-15 21:43:26,464 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 269) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 280) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 509) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L443 ceAbstractionStarter]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2019-11-15 21:43:26,464 INFO L439 ceAbstractionStarter]: At program point L107(lines 106 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-11-15 21:43:26,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,465 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 180) no Hoare annotation was computed. [2019-11-15 21:43:26,465 INFO L439 ceAbstractionStarter]: At program point L174-1(lines 1 582) 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-11-15 21:43:26,465 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,465 INFO L439 ceAbstractionStarter]: At program point L571(lines 563 573) 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-11-15 21:43:26,465 INFO L439 ceAbstractionStarter]: At program point L571-1(lines 563 573) the Hoare annotation is: false [2019-11-15 21:43:26,465 INFO L439 ceAbstractionStarter]: At program point L571-2(lines 563 573) the Hoare annotation is: false [2019-11-15 21:43:26,465 INFO L439 ceAbstractionStarter]: At program point L571-3(lines 563 573) the Hoare annotation is: false [2019-11-15 21:43:26,465 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 268) no Hoare annotation was computed. [2019-11-15 21:43:26,465 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 279) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 543) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L439 ceAbstractionStarter]: At program point L539-1(lines 539 543) 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-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 409) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L439 ceAbstractionStarter]: At program point L374(lines 367 416) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 380) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 267) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 278) no Hoare annotation was computed. [2019-11-15 21:43:26,466 INFO L439 ceAbstractionStarter]: At program point L46(lines 338 343) 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-11-15 21:43:26,466 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-15 21:43:26,467 INFO L439 ceAbstractionStarter]: At program point L443-1(lines 443 446) 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-11-15 21:43:26,467 INFO L443 ceAbstractionStarter]: For program point L443-2(lines 443 446) no Hoare annotation was computed. [2019-11-15 21:43:26,467 INFO L439 ceAbstractionStarter]: At program point L443-3(lines 443 446) 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-11-15 21:43:26,467 INFO L443 ceAbstractionStarter]: For program point L443-4(lines 443 446) no Hoare annotation was computed. [2019-11-15 21:43:26,467 INFO L439 ceAbstractionStarter]: At program point L443-5(lines 443 446) 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-11-15 21:43:26,467 INFO L443 ceAbstractionStarter]: For program point L443-6(lines 443 446) no Hoare annotation was computed. [2019-11-15 21:43:26,467 INFO L439 ceAbstractionStarter]: At program point L443-7(lines 443 446) 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-11-15 21:43:26,467 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 494) no Hoare annotation was computed. [2019-11-15 21:43:26,467 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 477 494) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L477-2(lines 477 494) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L477-3(lines 477 494) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L478-3(lines 478 484) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L478-6(lines 478 484) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 220) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L478-9(lines 478 484) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 266) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 277) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L579(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,468 INFO L443 ceAbstractionStarter]: For program point L579-1(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-2(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-3(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-4(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-5(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-6(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-7(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-8(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-9(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-10(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-11(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-12(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-13(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-14(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,469 INFO L443 ceAbstractionStarter]: For program point L579-15(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L580-3(lines 1 582) 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-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L580-6(lines 1 582) 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-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L382(lines 375 415) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L580-8(lines 1 582) 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-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L580-9(lines 1 582) 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-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L283(lines 73 285) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,470 INFO L439 ceAbstractionStarter]: At program point L580-11(lines 1 582) 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-11-15 21:43:26,471 INFO L439 ceAbstractionStarter]: At program point L580-12(lines 1 582) 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-11-15 21:43:26,471 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 265) no Hoare annotation was computed. [2019-11-15 21:43:26,471 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 276) no Hoare annotation was computed. [2019-11-15 21:43:26,474 INFO L439 ceAbstractionStarter]: At program point L580-14(lines 1 582) 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-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 560) no Hoare annotation was computed. [2019-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 472) no Hoare annotation was computed. [2019-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L449-1(lines 449 472) no Hoare annotation was computed. [2019-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L449-2(lines 449 472) no Hoare annotation was computed. [2019-11-15 21:43:26,475 INFO L446 ceAbstractionStarter]: At program point L383(lines 367 416) the Hoare annotation is: true [2019-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 365) no Hoare annotation was computed. [2019-11-15 21:43:26,475 INFO L443 ceAbstractionStarter]: For program point L449-3(lines 449 472) no Hoare annotation was computed. [2019-11-15 21:43:26,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:43:26,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,476 INFO L439 ceAbstractionStarter]: At program point L549(lines 548 560) 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-11-15 21:43:26,476 INFO L439 ceAbstractionStarter]: At program point L450(lines 449 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)) [2019-11-15 21:43:26,476 INFO L439 ceAbstractionStarter]: At program point L450-1(lines 449 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-11-15 21:43:26,477 INFO L439 ceAbstractionStarter]: At program point L450-2(lines 449 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-11-15 21:43:26,477 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 413) no Hoare annotation was computed. [2019-11-15 21:43:26,478 INFO L439 ceAbstractionStarter]: At program point L351(lines 350 365) 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-11-15 21:43:26,479 INFO L439 ceAbstractionStarter]: At program point L450-3(lines 449 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-11-15 21:43:26,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,479 INFO L446 ceAbstractionStarter]: At program point L418(lines 286 420) the Hoare annotation is: true [2019-11-15 21:43:26,479 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 412) no Hoare annotation was computed. [2019-11-15 21:43:26,480 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 264) no Hoare annotation was computed. [2019-11-15 21:43:26,480 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 275) no Hoare annotation was computed. [2019-11-15 21:43:26,480 INFO L439 ceAbstractionStarter]: At program point L551(lines 550 560) 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-11-15 21:43:26,481 INFO L439 ceAbstractionStarter]: At program point L518(lines 513 520) 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-11-15 21:43:26,481 INFO L439 ceAbstractionStarter]: At program point L518-1(lines 513 520) the Hoare annotation is: false [2019-11-15 21:43:26,481 INFO L439 ceAbstractionStarter]: At program point L518-2(lines 513 520) the Hoare annotation is: false [2019-11-15 21:43:26,481 INFO L439 ceAbstractionStarter]: At program point L518-3(lines 513 520) the Hoare annotation is: false [2019-11-15 21:43:26,481 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-15 21:43:26,481 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 365) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-11-15 21:43:26,481 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L486-2(lines 486 493) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 389) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L486-4(lines 486 493) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L439 ceAbstractionStarter]: At program point L321(lines 295 419) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L486-6(lines 486 493) no Hoare annotation was computed. [2019-11-15 21:43:26,482 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 471) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 471) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L454-2(lines 454 471) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L454-3(lines 454 471) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 196) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 263) no Hoare annotation was computed. [2019-11-15 21:43:26,483 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 274) no Hoare annotation was computed. [2019-11-15 21:43:26,484 INFO L443 ceAbstractionStarter]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2019-11-15 21:43:26,484 INFO L439 ceAbstractionStarter]: At program point L521(lines 521 562) 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-11-15 21:43:26,484 INFO L439 ceAbstractionStarter]: At program point L455(lines 454 471) 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-11-15 21:43:26,484 INFO L439 ceAbstractionStarter]: At program point L455-1(lines 454 471) 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-11-15 21:43:26,484 INFO L439 ceAbstractionStarter]: At program point L455-2(lines 454 471) 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-11-15 21:43:26,484 INFO L439 ceAbstractionStarter]: At program point L455-3(lines 454 471) 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-11-15 21:43:26,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,485 INFO L439 ceAbstractionStarter]: At program point L457(lines 456 471) 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-11-15 21:43:26,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,485 INFO L439 ceAbstractionStarter]: At program point L457-1(lines 456 471) 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-11-15 21:43:26,485 INFO L439 ceAbstractionStarter]: At program point L457-2(lines 456 471) 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-11-15 21:43:26,486 INFO L439 ceAbstractionStarter]: At program point L457-3(lines 456 471) 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-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 262) no Hoare annotation was computed. [2019-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 273) no Hoare annotation was computed. [2019-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 431) no Hoare annotation was computed. [2019-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point L425-2(lines 425 431) no Hoare annotation was computed. [2019-11-15 21:43:26,486 INFO L443 ceAbstractionStarter]: For program point L425-4(lines 425 431) no Hoare annotation was computed. [2019-11-15 21:43:26,487 INFO L439 ceAbstractionStarter]: At program point L260(lines 164 261) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,487 INFO L443 ceAbstractionStarter]: For program point L425-6(lines 425 431) no Hoare annotation was computed. [2019-11-15 21:43:26,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,487 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 545) no Hoare annotation was computed. [2019-11-15 21:43:26,487 INFO L439 ceAbstractionStarter]: At program point L394(lines 385 412) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:43:26,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L439 ceAbstractionStarter]: At program point L163(lines 109 279) 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-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 272) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 532) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 236) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:43:26,488 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-15 21:43:26,489 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 333) no Hoare annotation was computed. [2019-11-15 21:43:26,489 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 333) no Hoare annotation was computed. [2019-11-15 21:43:26,489 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,489 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-11-15 21:43:26,489 INFO L439 ceAbstractionStarter]: At program point L496(lines 435 498) 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-11-15 21:43:26,490 INFO L439 ceAbstractionStarter]: At program point L496-1(lines 435 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)) [2019-11-15 21:43:26,490 INFO L439 ceAbstractionStarter]: At program point L496-2(lines 435 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)) [2019-11-15 21:43:26,491 INFO L439 ceAbstractionStarter]: At program point L496-3(lines 435 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)) [2019-11-15 21:43:26,491 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 203) no Hoare annotation was computed. [2019-11-15 21:43:26,491 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 271) no Hoare annotation was computed. [2019-11-15 21:43:26,491 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 282) no Hoare annotation was computed. [2019-11-15 21:43:26,491 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-15 21:43:26,491 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 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-11-15 21:43:26,492 INFO L439 ceAbstractionStarter]: At program point L68(lines 321 366) 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-11-15 21:43:26,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:43:26 BoogieIcfgContainer [2019-11-15 21:43:26,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:43:26,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:43:26,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:43:26,560 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:43:26,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:22" (3/4) ... [2019-11-15 21:43:26,563 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:43:26,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2019-11-15 21:43:26,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-15 21:43:26,592 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 21:43:26,643 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-11-15 21:43:26,761 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_65f06f7f-db24-47a4-9bab-6e2214f92493/bin/uautomizer/witness.graphml [2019-11-15 21:43:26,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:43:26,763 INFO L168 Benchmark]: Toolchain (without parser) took 5333.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:26,763 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:26,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:26,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:26,765 INFO L168 Benchmark]: Boogie Preprocessor took 39.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:26,765 INFO L168 Benchmark]: RCFGBuilder took 820.00 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:26,766 INFO L168 Benchmark]: TraceAbstraction took 3799.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.6 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:26,766 INFO L168 Benchmark]: Witness Printer took 202.34 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-11-15 21:43:26,768 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 820.00 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3799.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.6 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. * Witness Printer took 202.34 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: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: 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: 295]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: 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: 526]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && status == 0) && NP == s) && !(MPR3 == s)) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && 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 - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 454]: 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 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 367]: 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: 103]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: 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: 521]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 375]: 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: 106]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 454]: 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: 454]: 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: 454]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 352]: 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: 550]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && 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: 513]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: 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: 338]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: 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.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 2113 SDtfs, 1457 SDslu, 1788 SDs, 0 SdLazy, 533 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s 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.2s 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.9s 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...