./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan --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 Taipan --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.25-f470102 [2019-12-07 19:30:22,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:30:22,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:30:22,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:30:22,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:30:22,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:30:22,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:30:22,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:30:22,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:30:22,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:30:22,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:30:22,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:30:22,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:30:22,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:30:22,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:30:22,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:30:22,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:30:22,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:30:22,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:30:22,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:30:22,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:30:22,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:30:22,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:30:22,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:30:22,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:30:22,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:30:22,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:30:22,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:30:22,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:30:22,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:30:22,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:30:22,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:30:22,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:30:22,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:30:22,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:30:22,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:30:22,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:30:22,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:30:22,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:30:22,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:30:22,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:30:22,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:30:22,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:30:22,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:30:22,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:30:22,332 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:30:22,332 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:30:22,333 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:30:22,333 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:30:22,333 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:30:22,333 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:30:22,333 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:30:22,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:30:22,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:30:22,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:30:22,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:30:22,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:30:22,336 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan 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 -> Taipan 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-12-07 19:30:22,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:30:22,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:30:22,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:30:22,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:30:22,446 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:30:22,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-12-07 19:30:22,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/data/31373a012/134e68b679334669869975033f1edbcc/FLAG7611bc650 [2019-12-07 19:30:22,846 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:30:22,846 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-12-07 19:30:22,853 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/data/31373a012/134e68b679334669869975033f1edbcc/FLAG7611bc650 [2019-12-07 19:30:22,863 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/data/31373a012/134e68b679334669869975033f1edbcc [2019-12-07 19:30:22,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:30:22,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:30:22,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:30:22,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:30:22,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:30:22,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:30:22" (1/1) ... [2019-12-07 19:30:22,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3a36ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:22, skipping insertion in model container [2019-12-07 19:30:22,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:30:22" (1/1) ... [2019-12-07 19:30:22,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:30:22,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:30:23,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:30:23,085 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:30:23,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:30:23,129 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:30:23,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23 WrapperNode [2019-12-07 19:30:23,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:30:23,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:30:23,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:30:23,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:30:23,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:30:23,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:30:23,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:30:23,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:30:23,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... [2019-12-07 19:30:23,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:30:23,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:30:23,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:30:23,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:30:23,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/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-12-07 19:30:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:30:23,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:30:23,312 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,316 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,321 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,324 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,326 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,329 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,332 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:30:23,665 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-12-07 19:30:23,665 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-12-07 19:30:23,665 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-12-07 19:30:23,665 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-12-07 19:30:23,665 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-12-07 19:30:23,666 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-12-07 19:30:23,667 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-12-07 19:30:23,667 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-12-07 19:30:23,995 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:30:23,995 INFO L287 CfgBuilder]: Removed 78 assume(true) statements. [2019-12-07 19:30:23,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:23 BoogieIcfgContainer [2019-12-07 19:30:23,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:30:23,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:30:23,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:30:23,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:30:23,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:30:22" (1/3) ... [2019-12-07 19:30:23,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11087c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:30:23, skipping insertion in model container [2019-12-07 19:30:23,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:30:23" (2/3) ... [2019-12-07 19:30:23,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11087c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:30:23, skipping insertion in model container [2019-12-07 19:30:23,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:23" (3/3) ... [2019-12-07 19:30:24,000 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-12-07 19:30:24,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:30:24,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 19:30:24,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 19:30:24,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:30:24,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:30:24,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:30:24,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:30:24,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:30:24,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:30:24,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:30:24,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:30:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-12-07 19:30:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:30:24,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,055 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 671809730, now seen corresponding path program 1 times [2019-12-07 19:30:24,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779797576] [2019-12-07 19:30:24,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779797576] [2019-12-07 19:30:24,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114137503] [2019-12-07 19:30:24,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,192 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2019-12-07 19:30:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,286 INFO L93 Difference]: Finished difference Result 182 states and 266 transitions. [2019-12-07 19:30:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:24,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 19:30:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,295 INFO L225 Difference]: With dead ends: 182 [2019-12-07 19:30:24,295 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 19:30:24,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 19:30:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-07 19:30:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:30:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2019-12-07 19:30:24,331 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 7 [2019-12-07 19:30:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,332 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2019-12-07 19:30:24,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2019-12-07 19:30:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:30:24,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,333 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash -648728712, now seen corresponding path program 1 times [2019-12-07 19:30:24,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661490473] [2019-12-07 19:30:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661490473] [2019-12-07 19:30:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647915867] [2019-12-07 19:30:24,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,376 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 3 states. [2019-12-07 19:30:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,400 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2019-12-07 19:30:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:24,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 19:30:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,402 INFO L225 Difference]: With dead ends: 156 [2019-12-07 19:30:24,402 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 19:30:24,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 19:30:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-12-07 19:30:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 19:30:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-12-07 19:30:24,410 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 8 [2019-12-07 19:30:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,411 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-12-07 19:30:24,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-12-07 19:30:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:30:24,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash 207254872, now seen corresponding path program 1 times [2019-12-07 19:30:24,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317725379] [2019-12-07 19:30:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317725379] [2019-12-07 19:30:24,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:24,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553664806] [2019-12-07 19:30:24,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,429 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 3 states. [2019-12-07 19:30:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,441 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2019-12-07 19:30:24,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:24,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 19:30:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,443 INFO L225 Difference]: With dead ends: 93 [2019-12-07 19:30:24,443 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 19:30:24,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 19:30:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 19:30:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-07 19:30:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 19:30:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-12-07 19:30:24,450 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 10 [2019-12-07 19:30:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,450 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-12-07 19:30:24,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-12-07 19:30:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:30:24,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,452 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash 535982816, now seen corresponding path program 1 times [2019-12-07 19:30:24,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919307032] [2019-12-07 19:30:24,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919307032] [2019-12-07 19:30:24,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380454691] [2019-12-07 19:30:24,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,487 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 3 states. [2019-12-07 19:30:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,541 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-12-07 19:30:24,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:24,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:30:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,543 INFO L225 Difference]: With dead ends: 80 [2019-12-07 19:30:24,543 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 19:30:24,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 19:30:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 19:30:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:30:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-12-07 19:30:24,549 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 14 [2019-12-07 19:30:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,549 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-12-07 19:30:24,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-12-07 19:30:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:30:24,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash 559806363, now seen corresponding path program 1 times [2019-12-07 19:30:24,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234412840] [2019-12-07 19:30:24,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234412840] [2019-12-07 19:30:24,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522726015] [2019-12-07 19:30:24,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,580 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 3 states. [2019-12-07 19:30:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,619 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2019-12-07 19:30:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:24,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 19:30:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,620 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:30:24,620 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 19:30:24,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 19:30:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 19:30:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:30:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-12-07 19:30:24,628 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 15 [2019-12-07 19:30:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,628 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-12-07 19:30:24,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-12-07 19:30:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:30:24,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,630 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1878512821, now seen corresponding path program 1 times [2019-12-07 19:30:24,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326930108] [2019-12-07 19:30:24,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326930108] [2019-12-07 19:30:24,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:30:24,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897435115] [2019-12-07 19:30:24,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:24,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:24,662 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 4 states. [2019-12-07 19:30:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,682 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-12-07 19:30:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:30:24,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 19:30:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,684 INFO L225 Difference]: With dead ends: 115 [2019-12-07 19:30:24,684 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 19:30:24,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12-07 19:30:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 19:30:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2019-12-07 19:30:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 19:30:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2019-12-07 19:30:24,690 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 16 [2019-12-07 19:30:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,690 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2019-12-07 19:30:24,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2019-12-07 19:30:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:30:24,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,692 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1480986174, now seen corresponding path program 1 times [2019-12-07 19:30:24,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212011610] [2019-12-07 19:30:24,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212011610] [2019-12-07 19:30:24,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971731154] [2019-12-07 19:30:24,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:24,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:24,738 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 4 states. [2019-12-07 19:30:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,790 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-12-07 19:30:24,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:30:24,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 19:30:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,791 INFO L225 Difference]: With dead ends: 99 [2019-12-07 19:30:24,792 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 19:30:24,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 19:30:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 19:30:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 19:30:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 19:30:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-12-07 19:30:24,811 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 17 [2019-12-07 19:30:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,811 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-12-07 19:30:24,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-12-07 19:30:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:30:24,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1607917556, now seen corresponding path program 1 times [2019-12-07 19:30:24,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462334955] [2019-12-07 19:30:24,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462334955] [2019-12-07 19:30:24,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:30:24,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009865134] [2019-12-07 19:30:24,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:24,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:24,847 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 5 states. [2019-12-07 19:30:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:24,932 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-12-07 19:30:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:24,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 19:30:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:24,933 INFO L225 Difference]: With dead ends: 90 [2019-12-07 19:30:24,933 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 19:30:24,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:30:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 19:30:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-12-07 19:30:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 19:30:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-12-07 19:30:24,938 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 18 [2019-12-07 19:30:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:24,938 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-12-07 19:30:24,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-12-07 19:30:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:30:24,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:24,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:24,940 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1748577235, now seen corresponding path program 1 times [2019-12-07 19:30:24,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:24,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662876323] [2019-12-07 19:30:24,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:24,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662876323] [2019-12-07 19:30:24,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:24,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:24,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947376948] [2019-12-07 19:30:24,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:24,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:24,966 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2019-12-07 19:30:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:25,003 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-12-07 19:30:25,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:25,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:30:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:25,004 INFO L225 Difference]: With dead ends: 82 [2019-12-07 19:30:25,004 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 19:30:25,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 19:30:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-12-07 19:30:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:30:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-12-07 19:30:25,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-12-07 19:30:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:25,009 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-12-07 19:30:25,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-12-07 19:30:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:30:25,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:25,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:25,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1621021588, now seen corresponding path program 1 times [2019-12-07 19:30:25,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:25,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9475624] [2019-12-07 19:30:25,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:25,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9475624] [2019-12-07 19:30:25,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:25,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:25,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770639194] [2019-12-07 19:30:25,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:25,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:25,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:25,029 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 3 states. [2019-12-07 19:30:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:25,036 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-12-07 19:30:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:25,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:30:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:25,037 INFO L225 Difference]: With dead ends: 110 [2019-12-07 19:30:25,037 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 19:30:25,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 19:30:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-12-07 19:30:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 19:30:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-12-07 19:30:25,041 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2019-12-07 19:30:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:25,041 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-12-07 19:30:25,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-12-07 19:30:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:30:25,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:25,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:25,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash -561666676, now seen corresponding path program 1 times [2019-12-07 19:30:25,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:25,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31506787] [2019-12-07 19:30:25,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:25,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31506787] [2019-12-07 19:30:25,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:25,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:30:25,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382220637] [2019-12-07 19:30:25,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:25,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:25,063 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 4 states. [2019-12-07 19:30:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:25,072 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-12-07 19:30:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:25,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 19:30:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:25,072 INFO L225 Difference]: With dead ends: 74 [2019-12-07 19:30:25,072 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 19:30:25,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 19:30:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 19:30:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 19:30:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-12-07 19:30:25,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 21 [2019-12-07 19:30:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:25,074 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-12-07 19:30:25,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-12-07 19:30:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:30:25,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:25,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:25,075 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1813263430, now seen corresponding path program 1 times [2019-12-07 19:30:25,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:25,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084539675] [2019-12-07 19:30:25,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:25,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084539675] [2019-12-07 19:30:25,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:25,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:30:25,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134561049] [2019-12-07 19:30:25,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:25,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:25,105 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 5 states. [2019-12-07 19:30:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:25,129 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-12-07 19:30:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:25,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:30:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:25,130 INFO L225 Difference]: With dead ends: 23 [2019-12-07 19:30:25,130 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:30:25,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:30:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:30:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:30:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:30:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:30:25,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-07 19:30:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:25,131 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:30:25,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:30:25,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:30:25,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:30:25,499 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,499 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,499 INFO L246 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L103(lines 103 281) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,500 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,500 INFO L246 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: false [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L469-1(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L469-2(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L469-3(lines 442 497) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,500 INFO L242 CegarLoopResult]: At program point L106(lines 106 280) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,500 INFO L246 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L242 CegarLoopResult]: At program point L174-1(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L242 CegarLoopResult]: At program point L539-1(lines 539 543) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,501 INFO L242 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,501 INFO L242 CegarLoopResult]: At program point L443(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,501 INFO L242 CegarLoopResult]: At program point L443-1(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-2(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-3(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-4(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-5(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-6(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L242 CegarLoopResult]: At program point L443-7(lines 443 446) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L477-1(lines 477 494) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 494) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L477-3(lines 477 494) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L579(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,502 INFO L246 CegarLoopResult]: For program point L579-1(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-2(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-3(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-4(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-5(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-6(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-7(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-8(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-9(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-10(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-11(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-12(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-13(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-14(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L246 CegarLoopResult]: For program point L579-15(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,503 INFO L242 CegarLoopResult]: At program point L580-3(lines 1 582) the Hoare annotation is: (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (or .cse0 (= ~NP~0 ~s~0)) (not (= 0 ~compRegistered~0)) (= ULTIMATE.start_main_~status~1 0) (or (= ~MPR3~0 ~s~0) (not .cse0)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-12-07 19:30:25,503 INFO L242 CegarLoopResult]: At program point L580-6(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,503 INFO L242 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L580-8(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L580-9(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L580-11(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L580-12(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L580-14(lines 1 582) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,504 INFO L249 CegarLoopResult]: At program point L383(lines 367 416) the Hoare annotation is: true [2019-12-07 19:30:25,504 INFO L242 CegarLoopResult]: At program point L350(lines 350 365) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L249 CegarLoopResult]: At program point L418(lines 286 420) the Hoare annotation is: true [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L486-2(lines 486 493) no Hoare annotation was computed. [2019-12-07 19:30:25,504 INFO L246 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L486-4(lines 486 493) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L242 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L486-6(lines 486 493) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L425(lines 425 431) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L425-2(lines 425 431) no Hoare annotation was computed. [2019-12-07 19:30:25,505 INFO L246 CegarLoopResult]: For program point L425-4(lines 425 431) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L242 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point L425-6(lines 425 431) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L242 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,506 INFO L242 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,506 INFO L246 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-12-07 19:30:25,507 INFO L242 CegarLoopResult]: At program point L100(lines 100 282) the Hoare annotation is: (and (or (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~__cil_tmp8~0 0)) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-12-07 19:30:25,507 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-12-07 19:30:25,507 INFO L242 CegarLoopResult]: 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-12-07 19:30:25,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:30:25 BoogieIcfgContainer [2019-12-07 19:30:25,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:30:25,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:30:25,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:30:25,534 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:30:25,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:30:23" (3/4) ... [2019-12-07 19:30:25,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:30:25,556 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2019-12-07 19:30:25,558 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-12-07 19:30:25,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 19:30:25,655 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec3369f3-64c5-42bc-b0e9-d7da3b13d602/bin/utaipan/witness.graphml [2019-12-07 19:30:25,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:30:25,657 INFO L168 Benchmark]: Toolchain (without parser) took 2790.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.2 MB in the beginning and 905.4 MB in the end (delta: 39.8 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,657 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:30:25,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.15 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-12-07 19:30:25,658 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,658 INFO L168 Benchmark]: RCFGBuilder took 799.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,658 INFO L168 Benchmark]: TraceAbstraction took 1537.19 ms. Allocated memory is still 1.2 GB. Free memory was 975.5 MB in the beginning and 923.0 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,658 INFO L168 Benchmark]: Witness Printer took 121.67 ms. Allocated memory is still 1.2 GB. Free memory was 923.0 MB in the beginning and 905.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:25,660 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.15 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 27.65 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 799.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1537.19 ms. Allocated memory is still 1.2 GB. Free memory was 975.5 MB in the beginning and 923.0 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Witness Printer took 121.67 ms. Allocated memory is still 1.2 GB. Free memory was 923.0 MB in the beginning and 905.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 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: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && s == NP) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && (259 == returnVal2 || NP == s)) && !(0 == compRegistered)) && status == 0) && (MPR3 == s || !(259 == returnVal2))) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && !(0 == compRegistered)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && MPR1 == s) && !(0 == compRegistered)) && status == 0) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((__cil_tmp8 == 1 || __cil_tmp8 == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 16 error locations. Result: SAFE, OverallTime: 1.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 949 SDtfs, 634 SDslu, 438 SDs, 0 SdLazy, 416 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 89 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 35 PreInvPairs, 65 NumberOfFragments, 805 HoareAnnotationTreeSize, 35 FomulaSimplifications, 886 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 6207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...