./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/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 e4d1760c3f63950e961525df0d726cb05fa47146 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:13:34,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:13:34,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:13:34,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:13:34,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:13:34,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:13:34,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:13:34,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:13:34,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:13:34,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:13:34,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:13:34,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:13:34,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:13:34,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:13:34,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:13:34,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:13:34,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:13:34,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:13:34,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:13:34,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:13:34,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:13:34,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:13:34,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:13:34,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:13:34,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:13:34,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:13:34,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:13:34,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:13:34,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:13:34,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:13:34,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:13:34,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:13:34,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:13:34,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:13:34,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:13:34,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:13:34,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:13:34,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:13:34,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:13:34,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:13:34,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:13:34,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:13:34,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:13:34,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:13:34,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:13:34,648 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:13:34,648 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:13:34,648 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:13:34,648 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:13:34,649 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:13:34,649 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:13:34,649 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:13:34,649 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:13:34,649 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:13:34,650 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:13:34,650 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:13:34,650 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:13:34,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:13:34,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:13:34,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:13:34,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:13:34,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:13:34,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:13:34,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:13:34,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:13:34,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:13:34,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:13:34,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:13:34,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:13:34,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:13:34,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:13:34,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:13:34,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:13:34,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:13:34,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:13:34,656 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:13:34,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:13:34,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:13:34,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:13:34,657 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_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/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 -> e4d1760c3f63950e961525df0d726cb05fa47146 [2019-11-26 02:13:34,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:13:34,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:13:34,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:13:34,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:13:34,845 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:13:34,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-26 02:13:34,902 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/data/f5b72472d/832b5a0ecca14c20af4614ee9d831707/FLAGe190f0d1f [2019-11-26 02:13:35,348 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:13:35,348 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-26 02:13:35,373 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/data/f5b72472d/832b5a0ecca14c20af4614ee9d831707/FLAGe190f0d1f [2019-11-26 02:13:35,664 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/data/f5b72472d/832b5a0ecca14c20af4614ee9d831707 [2019-11-26 02:13:35,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:13:35,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:13:35,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:13:35,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:13:35,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:13:35,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:13:35" (1/1) ... [2019-11-26 02:13:35,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262dd06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:35, skipping insertion in model container [2019-11-26 02:13:35,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:13:35" (1/1) ... [2019-11-26 02:13:35,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:13:35,739 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:13:36,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:13:36,061 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:13:36,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:13:36,160 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:13:36,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36 WrapperNode [2019-11-26 02:13:36,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:13:36,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:13:36,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:13:36,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:13:36,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:13:36,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:13:36,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:13:36,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:13:36,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... [2019-11-26 02:13:36,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:13:36,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:13:36,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:13:36,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:13:36,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/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-11-26 02:13:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:13:36,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:13:36,593 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,602 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,612 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,624 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,630 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,636 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,645 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,652 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,661 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,667 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,672 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:36,691 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:13:37,665 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-26 02:13:37,665 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-26 02:13:37,666 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-26 02:13:37,667 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-26 02:13:37,668 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-26 02:13:37,668 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-26 02:13:37,668 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-26 02:13:37,668 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-26 02:13:37,668 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-26 02:13:38,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:13:38,543 INFO L284 CfgBuilder]: Removed 152 assume(true) statements. [2019-11-26 02:13:38,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:38 BoogieIcfgContainer [2019-11-26 02:13:38,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:13:38,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:13:38,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:13:38,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:13:38,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:13:35" (1/3) ... [2019-11-26 02:13:38,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a3b8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:13:38, skipping insertion in model container [2019-11-26 02:13:38,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:36" (2/3) ... [2019-11-26 02:13:38,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a3b8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:13:38, skipping insertion in model container [2019-11-26 02:13:38,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:38" (3/3) ... [2019-11-26 02:13:38,553 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-26 02:13:38,561 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:13:38,568 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-26 02:13:38,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-26 02:13:38,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:13:38,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:13:38,617 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:13:38,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:13:38,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:13:38,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:13:38,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:13:38,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:13:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-26 02:13:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:13:38,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:38,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:38,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1094760104, now seen corresponding path program 1 times [2019-11-26 02:13:38,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:38,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121686795] [2019-11-26 02:13:38,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:38,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121686795] [2019-11-26 02:13:38,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:38,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:38,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983013870] [2019-11-26 02:13:38,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:38,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:38,934 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-26 02:13:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,196 INFO L93 Difference]: Finished difference Result 349 states and 520 transitions. [2019-11-26 02:13:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:13:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,213 INFO L225 Difference]: With dead ends: 349 [2019-11-26 02:13:39,213 INFO L226 Difference]: Without dead ends: 180 [2019-11-26 02:13:39,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-26 02:13:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-26 02:13:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-26 02:13:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 241 transitions. [2019-11-26 02:13:39,287 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 241 transitions. Word has length 9 [2019-11-26 02:13:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,288 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 241 transitions. [2019-11-26 02:13:39,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 241 transitions. [2019-11-26 02:13:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:13:39,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1602184203, now seen corresponding path program 1 times [2019-11-26 02:13:39,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079025912] [2019-11-26 02:13:39,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:39,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079025912] [2019-11-26 02:13:39,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:39,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:13:39,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373110766] [2019-11-26 02:13:39,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,346 INFO L87 Difference]: Start difference. First operand 180 states and 241 transitions. Second operand 3 states. [2019-11-26 02:13:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,384 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2019-11-26 02:13:39,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-26 02:13:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,387 INFO L225 Difference]: With dead ends: 193 [2019-11-26 02:13:39,387 INFO L226 Difference]: Without dead ends: 180 [2019-11-26 02:13:39,388 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-11-26 02:13:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-26 02:13:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-26 02:13:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-26 02:13:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2019-11-26 02:13:39,410 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 10 [2019-11-26 02:13:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,410 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2019-11-26 02:13:39,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2019-11-26 02:13:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:13:39,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash 724220205, now seen corresponding path program 1 times [2019-11-26 02:13:39,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400771325] [2019-11-26 02:13:39,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:39,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400771325] [2019-11-26 02:13:39,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:39,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:39,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719219493] [2019-11-26 02:13:39,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:39,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,476 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand 3 states. [2019-11-26 02:13:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,522 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2019-11-26 02:13:39,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-26 02:13:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,524 INFO L225 Difference]: With dead ends: 276 [2019-11-26 02:13:39,525 INFO L226 Difference]: Without dead ends: 182 [2019-11-26 02:13:39,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-26 02:13:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2019-11-26 02:13:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-26 02:13:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2019-11-26 02:13:39,537 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 10 [2019-11-26 02:13:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,537 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2019-11-26 02:13:39,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2019-11-26 02:13:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:13:39,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,540 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash 305808601, now seen corresponding path program 1 times [2019-11-26 02:13:39,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516229062] [2019-11-26 02:13:39,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:39,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516229062] [2019-11-26 02:13:39,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:39,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:39,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287491287] [2019-11-26 02:13:39,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:39,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,590 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand 3 states. [2019-11-26 02:13:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,712 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2019-11-26 02:13:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-26 02:13:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,714 INFO L225 Difference]: With dead ends: 150 [2019-11-26 02:13:39,714 INFO L226 Difference]: Without dead ends: 136 [2019-11-26 02:13:39,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-26 02:13:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-26 02:13:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:13:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-11-26 02:13:39,723 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 15 [2019-11-26 02:13:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,724 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-11-26 02:13:39,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-11-26 02:13:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:13:39,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 617884193, now seen corresponding path program 1 times [2019-11-26 02:13:39,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138901102] [2019-11-26 02:13:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:39,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138901102] [2019-11-26 02:13:39,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:39,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:39,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025292488] [2019-11-26 02:13:39,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:39,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,793 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-11-26 02:13:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,817 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2019-11-26 02:13:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:13:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,819 INFO L225 Difference]: With dead ends: 182 [2019-11-26 02:13:39,819 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:13:39,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:13:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:13:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:13:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2019-11-26 02:13:39,827 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 18 [2019-11-26 02:13:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,828 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-11-26 02:13:39,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2019-11-26 02:13:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:13:39,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,829 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -819803429, now seen corresponding path program 1 times [2019-11-26 02:13:39,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931255875] [2019-11-26 02:13:39,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:39,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931255875] [2019-11-26 02:13:39,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:39,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:39,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092130478] [2019-11-26 02:13:39,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:39,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,862 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand 3 states. [2019-11-26 02:13:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:39,985 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2019-11-26 02:13:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:39,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:13:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:39,986 INFO L225 Difference]: With dead ends: 166 [2019-11-26 02:13:39,987 INFO L226 Difference]: Without dead ends: 133 [2019-11-26 02:13:39,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-26 02:13:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-26 02:13:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-26 02:13:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2019-11-26 02:13:39,994 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 18 [2019-11-26 02:13:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:39,994 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2019-11-26 02:13:39,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2019-11-26 02:13:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:13:39,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:39,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:39,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -181215385, now seen corresponding path program 1 times [2019-11-26 02:13:39,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:39,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885555163] [2019-11-26 02:13:39,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885555163] [2019-11-26 02:13:40,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:40,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031324467] [2019-11-26 02:13:40,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:40,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,073 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand 3 states. [2019-11-26 02:13:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,098 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2019-11-26 02:13:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:40,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-26 02:13:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,100 INFO L225 Difference]: With dead ends: 177 [2019-11-26 02:13:40,100 INFO L226 Difference]: Without dead ends: 145 [2019-11-26 02:13:40,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-26 02:13:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2019-11-26 02:13:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 02:13:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2019-11-26 02:13:40,109 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 19 [2019-11-26 02:13:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,109 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2019-11-26 02:13:40,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2019-11-26 02:13:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:13:40,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,112 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-11-26 02:13:40,112 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1177275976, now seen corresponding path program 1 times [2019-11-26 02:13:40,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721567578] [2019-11-26 02:13:40,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721567578] [2019-11-26 02:13:40,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:40,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990024536] [2019-11-26 02:13:40,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:13:40,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:13:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:13:40,175 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 4 states. [2019-11-26 02:13:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,313 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2019-11-26 02:13:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:13:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-26 02:13:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,315 INFO L225 Difference]: With dead ends: 161 [2019-11-26 02:13:40,315 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 02:13:40,316 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-11-26 02:13:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 02:13:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-26 02:13:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 02:13:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2019-11-26 02:13:40,324 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 20 [2019-11-26 02:13:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,325 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2019-11-26 02:13:40,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:13:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2019-11-26 02:13:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:13:40,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,326 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-11-26 02:13:40,328 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash -557599436, now seen corresponding path program 1 times [2019-11-26 02:13:40,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458442021] [2019-11-26 02:13:40,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458442021] [2019-11-26 02:13:40,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:40,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750282477] [2019-11-26 02:13:40,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:40,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,377 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand 3 states. [2019-11-26 02:13:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,396 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2019-11-26 02:13:40,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:40,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-26 02:13:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,397 INFO L225 Difference]: With dead ends: 138 [2019-11-26 02:13:40,397 INFO L226 Difference]: Without dead ends: 29 [2019-11-26 02:13:40,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-26 02:13:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-26 02:13:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-26 02:13:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-26 02:13:40,400 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2019-11-26 02:13:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,400 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-26 02:13:40,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-26 02:13:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:13:40,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,401 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-11-26 02:13:40,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1370950513, now seen corresponding path program 1 times [2019-11-26 02:13:40,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218956147] [2019-11-26 02:13:40,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218956147] [2019-11-26 02:13:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:13:40,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343208042] [2019-11-26 02:13:40,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:13:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:13:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:13:40,479 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2019-11-26 02:13:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,532 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-26 02:13:40,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:13:40,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-26 02:13:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,533 INFO L225 Difference]: With dead ends: 33 [2019-11-26 02:13:40,533 INFO L226 Difference]: Without dead ends: 29 [2019-11-26 02:13:40,534 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-11-26 02:13:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-26 02:13:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-26 02:13:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-26 02:13:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-11-26 02:13:40,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2019-11-26 02:13:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,536 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-11-26 02:13:40,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:13:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-11-26 02:13:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:13:40,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:40,538 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 384562189, now seen corresponding path program 1 times [2019-11-26 02:13:40,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850184089] [2019-11-26 02:13:40,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850184089] [2019-11-26 02:13:40,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556587993] [2019-11-26 02:13:40,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,560 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 3 states. [2019-11-26 02:13:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,576 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-26 02:13:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:40,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-26 02:13:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,577 INFO L225 Difference]: With dead ends: 33 [2019-11-26 02:13:40,577 INFO L226 Difference]: Without dead ends: 31 [2019-11-26 02:13:40,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-26 02:13:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-26 02:13:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-26 02:13:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-11-26 02:13:40,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2019-11-26 02:13:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,581 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-11-26 02:13:40,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-11-26 02:13:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:13:40,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:40,582 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -971132746, now seen corresponding path program 1 times [2019-11-26 02:13:40,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127115825] [2019-11-26 02:13:40,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127115825] [2019-11-26 02:13:40,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:40,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250014917] [2019-11-26 02:13:40,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:40,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,605 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 3 states. [2019-11-26 02:13:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,610 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-26 02:13:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:40,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:13:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,611 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:13:40,611 INFO L226 Difference]: Without dead ends: 26 [2019-11-26 02:13:40,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-26 02:13:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-26 02:13:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-26 02:13:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-11-26 02:13:40,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2019-11-26 02:13:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,614 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-11-26 02:13:40,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-11-26 02:13:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:13:40,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:40,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:40,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1845403150, now seen corresponding path program 1 times [2019-11-26 02:13:40,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:40,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796633407] [2019-11-26 02:13:40,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:40,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796633407] [2019-11-26 02:13:40,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:40,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:13:40,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771958399] [2019-11-26 02:13:40,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:13:40,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:13:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:13:40,648 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 4 states. [2019-11-26 02:13:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:40,660 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-11-26 02:13:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:13:40,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-26 02:13:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:40,661 INFO L225 Difference]: With dead ends: 26 [2019-11-26 02:13:40,661 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:13:40,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-26 02:13:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:13:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:13:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:13:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:13:40,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-26 02:13:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:40,663 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:13:40,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:13:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:13:40,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:13:40,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:13:41,507 INFO L444 ceAbstractionStarter]: For program point L894(lines 894 982) no Hoare annotation was computed. [2019-11-26 02:13:41,507 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,507 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-26 02:13:41,508 INFO L440 ceAbstractionStarter]: At program point L366(lines 366 407) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,508 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,508 INFO L440 ceAbstractionStarter]: At program point L169(lines 115 286) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,508 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,508 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 243) no Hoare annotation was computed. [2019-11-26 02:13:41,508 INFO L440 ceAbstractionStarter]: At program point L106(lines 106 289) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,508 INFO L440 ceAbstractionStarter]: At program point L371(lines 371 406) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L636(lines 636 654) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L636-1(lines 636 654) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 980) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L440 ceAbstractionStarter]: At program point L439(lines 430 457) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 187) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L440 ceAbstractionStarter]: At program point L109(lines 109 288) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 653) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L639-1(lines 639 653) no Hoare annotation was computed. [2019-11-26 02:13:41,509 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 445) no Hoare annotation was computed. [2019-11-26 02:13:41,510 INFO L440 ceAbstractionStarter]: At program point L970(lines 865 1004) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,510 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,510 INFO L440 ceAbstractionStarter]: At program point L112(lines 112 287) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 652) no Hoare annotation was computed. [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point L642-1(lines 642 652) no Hoare annotation was computed. [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,511 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 186) no Hoare annotation was computed. [2019-11-26 02:13:41,512 INFO L440 ceAbstractionStarter]: At program point L180-1(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,512 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,512 INFO L440 ceAbstractionStarter]: At program point L643(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,512 INFO L440 ceAbstractionStarter]: At program point L643-1(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,512 INFO L444 ceAbstractionStarter]: For program point L908(lines 908 978) no Hoare annotation was computed. [2019-11-26 02:13:41,512 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,513 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 598) no Hoare annotation was computed. [2019-11-26 02:13:41,513 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-26 02:13:41,513 INFO L440 ceAbstractionStarter]: At program point L52(lines 345 347) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,513 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 976) no Hoare annotation was computed. [2019-11-26 02:13:41,513 INFO L440 ceAbstractionStarter]: At program point L651(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,513 INFO L440 ceAbstractionStarter]: At program point L651-1(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,514 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:13:41,514 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,514 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,514 INFO L440 ceAbstractionStarter]: At program point L587(lines 579 598) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (<= 0 .cse0) (not (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-26 02:13:41,514 INFO L440 ceAbstractionStarter]: At program point L522(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,515 INFO L440 ceAbstractionStarter]: At program point L522-1(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,515 INFO L440 ceAbstractionStarter]: At program point L522-2(lines 486 550) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-26 02:13:41,515 INFO L440 ceAbstractionStarter]: At program point L522-3(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,515 INFO L440 ceAbstractionStarter]: At program point L522-4(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,515 INFO L440 ceAbstractionStarter]: At program point L522-5(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,516 INFO L440 ceAbstractionStarter]: At program point L522-6(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,516 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,516 INFO L440 ceAbstractionStarter]: At program point L787(lines 751 818) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,516 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,516 INFO L440 ceAbstractionStarter]: At program point L722(lines 697 741) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,516 INFO L444 ceAbstractionStarter]: For program point L922(lines 922 974) no Hoare annotation was computed. [2019-11-26 02:13:41,517 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-11-26 02:13:41,517 INFO L440 ceAbstractionStarter]: At program point L592-1(lines 592 596) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-26 02:13:41,517 INFO L440 ceAbstractionStarter]: At program point L328(lines 322 463) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,517 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 203) no Hoare annotation was computed. [2019-11-26 02:13:41,517 INFO L444 ceAbstractionStarter]: For program point L197-2(lines 170 266) no Hoare annotation was computed. [2019-11-26 02:13:41,517 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L447 ceAbstractionStarter]: At program point L462(lines 293 464) the Hoare annotation is: true [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530-1(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530-3(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530-4(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,518 INFO L444 ceAbstractionStarter]: For program point L530-5(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point L530-6(lines 530 547) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 815) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L440 ceAbstractionStarter]: At program point L267(lines 170 268) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point L929(lines 929 972) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,519 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-2(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-4(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-6(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-8(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-10(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-12(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,520 INFO L444 ceAbstractionStarter]: For program point L469-14(lines 469 475) no Hoare annotation was computed. [2019-11-26 02:13:41,521 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 971) no Hoare annotation was computed. [2019-11-26 02:13:41,521 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,521 INFO L440 ceAbstractionStarter]: At program point L74(lines 328 411) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,521 INFO L440 ceAbstractionStarter]: At program point L933(lines 873 988) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,521 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,521 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-2(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-4(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-6(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-8(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-10(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,522 INFO L444 ceAbstractionStarter]: For program point L539-12(lines 539 546) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L444 ceAbstractionStarter]: For program point L672(lines 672 678) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L444 ceAbstractionStarter]: For program point L672-2(lines 672 678) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L444 ceAbstractionStarter]: For program point L672-4(lines 672 678) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,523 INFO L440 ceAbstractionStarter]: At program point L1003(lines 820 1005) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point L873(lines 873 988) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 814) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:13:41,524 INFO L444 ceAbstractionStarter]: For program point L1011(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-1(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-2(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-3(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-4(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-5(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-6(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,525 INFO L444 ceAbstractionStarter]: For program point L1011-7(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-8(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-9(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-10(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-11(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-12(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-13(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,526 INFO L444 ceAbstractionStarter]: For program point L1011-14(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-15(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-16(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-17(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-18(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-19(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,527 INFO L440 ceAbstractionStarter]: At program point L351(lines 351 410) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,527 INFO L444 ceAbstractionStarter]: For program point L1011-20(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-21(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-22(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-23(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-24(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-25(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-26(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,528 INFO L444 ceAbstractionStarter]: For program point L1011-27(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,529 INFO L444 ceAbstractionStarter]: For program point L1011-28(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,529 INFO L440 ceAbstractionStarter]: At program point L1012(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,529 INFO L440 ceAbstractionStarter]: At program point L1012-2(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,529 INFO L440 ceAbstractionStarter]: At program point L1012-3(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,529 INFO L440 ceAbstractionStarter]: At program point L1012-5(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-9(lines 1 1014) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (or .cse0 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (not (= 1 ~pended~0)) (<= 0 .cse1) (or .cse0 (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-12(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-14(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-15(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-17(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,530 INFO L440 ceAbstractionStarter]: At program point L1012-18(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,531 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,531 INFO L440 ceAbstractionStarter]: At program point L1012-20(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,531 INFO L440 ceAbstractionStarter]: At program point L1012-21(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,531 INFO L440 ceAbstractionStarter]: At program point L1012-23(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,531 INFO L440 ceAbstractionStarter]: At program point L1012-24(lines 552 565) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,532 INFO L440 ceAbstractionStarter]: At program point L1012-25(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,532 INFO L440 ceAbstractionStarter]: At program point L1012-27(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,532 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,532 INFO L440 ceAbstractionStarter]: At program point L881(lines 881 986) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,532 INFO L440 ceAbstractionStarter]: At program point L419(lines 412 461) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,533 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 227) no Hoare annotation was computed. [2019-11-26 02:13:41,533 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,533 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,533 INFO L440 ceAbstractionStarter]: At program point L487(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,533 INFO L440 ceAbstractionStarter]: At program point L487-1(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,533 INFO L440 ceAbstractionStarter]: At program point L487-2(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,534 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. [2019-11-26 02:13:41,534 INFO L440 ceAbstractionStarter]: At program point L487-3(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,534 INFO L440 ceAbstractionStarter]: At program point L487-4(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,534 INFO L440 ceAbstractionStarter]: At program point L487-5(lines 487 499) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1))) [2019-11-26 02:13:41,534 INFO L440 ceAbstractionStarter]: At program point L487-6(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,535 INFO L440 ceAbstractionStarter]: At program point L487-7(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,535 INFO L440 ceAbstractionStarter]: At program point L487-8(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,535 INFO L440 ceAbstractionStarter]: At program point L487-9(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,535 INFO L440 ceAbstractionStarter]: At program point L487-10(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,535 INFO L440 ceAbstractionStarter]: At program point L487-11(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,536 INFO L440 ceAbstractionStarter]: At program point L487-12(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,536 INFO L440 ceAbstractionStarter]: At program point L487-13(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,536 INFO L440 ceAbstractionStarter]: At program point L752(lines 752 764) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,536 INFO L440 ceAbstractionStarter]: At program point L752-1(lines 752 764) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-26 02:13:41,536 INFO L440 ceAbstractionStarter]: At program point L356(lines 356 409) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,536 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 562) no Hoare annotation was computed. [2019-11-26 02:13:41,537 INFO L444 ceAbstractionStarter]: For program point L556-2(lines 556 562) no Hoare annotation was computed. [2019-11-26 02:13:41,537 INFO L440 ceAbstractionStarter]: At program point L889(lines 889 984) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,537 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,537 INFO L444 ceAbstractionStarter]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,537 INFO L440 ceAbstractionStarter]: At program point L427(lines 420 460) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,537 INFO L440 ceAbstractionStarter]: At program point L361(lines 361 408) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L493-4(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L493-6(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L493-8(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L493-10(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L493-12(lines 493 497) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2019-11-26 02:13:41,538 INFO L447 ceAbstractionStarter]: At program point L428(lines 412 461) the Hoare annotation is: true [2019-11-26 02:13:41,539 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 458) no Hoare annotation was computed. [2019-11-26 02:13:41,539 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 457) no Hoare annotation was computed. [2019-11-26 02:13:41,539 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,539 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 437) no Hoare annotation was computed. [2019-11-26 02:13:41,539 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-26 02:13:41,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:13:41 BoogieIcfgContainer [2019-11-26 02:13:41,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:13:41,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:13:41,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:13:41,588 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:13:41,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:38" (3/4) ... [2019-11-26 02:13:41,604 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:13:41,641 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 150 nodes and edges [2019-11-26 02:13:41,644 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2019-11-26 02:13:41,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:13:41,891 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b9e44e52-32fe-4aab-9fb9-bd115ab930ba/bin/utaipan/witness.graphml [2019-11-26 02:13:41,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:13:41,894 INFO L168 Benchmark]: Toolchain (without parser) took 6225.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 92.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,895 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:41,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -244.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,896 INFO L168 Benchmark]: Boogie Preprocessor took 123.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:41,897 INFO L168 Benchmark]: RCFGBuilder took 2151.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 953.9 MB in the end (delta: 228.4 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,897 INFO L168 Benchmark]: TraceAbstraction took 3042.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.8 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,897 INFO L168 Benchmark]: Witness Printer took 303.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:41,899 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 492.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -244.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2151.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 953.9 MB in the end (delta: 228.4 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3042.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.8 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Witness Printer took 303.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((s == NP && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 820]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((s == NP || (returnVal2 <= 259 && 259 <= returnVal2)) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 <= __cil_tmp7 + 1073741802) && !(MPR3 == s)) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 29 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1722 SDtfs, 972 SDslu, 757 SDs, 0 SdLazy, 445 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 131 NumberOfFragments, 1326 HoareAnnotationTreeSize, 71 FomulaSimplifications, 169 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 7702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...