./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 411af8a324a718637cdc1e76e82ebb1de5e49e9c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:21:37,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:21:37,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:21:37,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:21:37,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:21:37,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:21:37,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:21:37,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:21:37,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:21:37,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:21:37,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:21:37,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:21:37,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:21:37,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:21:37,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:21:37,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:21:37,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:21:37,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:21:37,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:21:37,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:21:37,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:21:37,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:21:37,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:21:37,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:21:37,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:21:37,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:21:37,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:21:37,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:21:37,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:21:37,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:21:37,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:21:37,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:21:37,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:21:37,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:21:37,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:21:37,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:21:37,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:21:37,418 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:21:37,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:21:37,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:21:37,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:21:37,423 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:21:37,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:21:37,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:21:37,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:21:37,425 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:21:37,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:21:37,425 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:21:37,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:21:37,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:21:37,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:21:37,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:21:37,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:21:37,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:21:37,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:21:37,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:21:37,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:21:37,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:21:37,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:21:37,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:21:37,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 411af8a324a718637cdc1e76e82ebb1de5e49e9c [2019-01-11 21:21:37,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:21:37,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:21:37,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:21:37,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:21:37,501 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:21:37,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:37,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a675f50/b923f9d4c55f4a2e85b7f1e96a97d0e9/FLAGfe7260e4a [2019-01-11 21:21:38,065 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:21:38,068 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:38,086 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a675f50/b923f9d4c55f4a2e85b7f1e96a97d0e9/FLAGfe7260e4a [2019-01-11 21:21:38,389 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a675f50/b923f9d4c55f4a2e85b7f1e96a97d0e9 [2019-01-11 21:21:38,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:21:38,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:21:38,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:21:38,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:21:38,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:21:38,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:38,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195518dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38, skipping insertion in model container [2019-01-11 21:21:38,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:38,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:21:38,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:21:38,731 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:21:38,737 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:21:38,830 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:21:38,857 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:21:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38 WrapperNode [2019-01-11 21:21:38,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:21:38,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:21:38,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:21:38,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:21:38,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:38,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:21:39,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:21:39,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:21:39,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:21:39,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... [2019-01-11 21:21:39,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:21:39,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:21:39,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:21:39,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:21:39,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-11 21:21:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:21:39,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:21:39,548 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,556 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,569 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,584 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,590 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,596 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,603 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,607 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,611 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,613 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,615 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:39,622 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:41,647 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-01-11 21:21:41,648 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-01-11 21:21:41,648 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-01-11 21:21:41,648 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-01-11 21:21:41,648 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-01-11 21:21:41,649 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-01-11 21:21:41,649 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-01-11 21:21:41,649 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-01-11 21:21:41,649 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-01-11 21:21:41,649 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-01-11 21:21:41,650 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:21:41,650 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:21:41,650 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-01-11 21:21:41,651 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-01-11 21:21:41,652 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-01-11 21:21:41,652 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-01-11 21:21:41,652 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-01-11 21:21:41,652 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-01-11 21:21:41,652 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-01-11 21:21:41,654 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:21:41,654 INFO L286 CfgBuilder]: Removed 152 assue(true) statements. [2019-01-11 21:21:41,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:41 BoogieIcfgContainer [2019-01-11 21:21:41,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:21:41,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:21:41,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:21:41,659 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:21:41,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:21:38" (1/3) ... [2019-01-11 21:21:41,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d7aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:21:41, skipping insertion in model container [2019-01-11 21:21:41,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:38" (2/3) ... [2019-01-11 21:21:41,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d7aac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:21:41, skipping insertion in model container [2019-01-11 21:21:41,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:41" (3/3) ... [2019-01-11 21:21:41,662 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:41,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:21:41,680 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-01-11 21:21:41,692 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-01-11 21:21:41,726 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:21:41,727 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:21:41,727 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:21:41,727 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:21:41,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:21:41,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:21:41,728 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:21:41,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:21:41,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:21:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-01-11 21:21:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 21:21:41,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:41,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:41,763 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-01-11 21:21:41,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:41,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:41,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:41,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:41,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:41,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:41,960 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 3 states. [2019-01-11 21:21:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:42,167 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2019-01-11 21:21:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:42,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-11 21:21:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:42,186 INFO L225 Difference]: With dead ends: 574 [2019-01-11 21:21:42,187 INFO L226 Difference]: Without dead ends: 320 [2019-01-11 21:21:42,192 INFO L631 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-01-11 21:21:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-11 21:21:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-01-11 21:21:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-11 21:21:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 438 transitions. [2019-01-11 21:21:42,254 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 438 transitions. Word has length 11 [2019-01-11 21:21:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:42,254 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 438 transitions. [2019-01-11 21:21:42,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 438 transitions. [2019-01-11 21:21:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:21:42,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:42,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:42,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-01-11 21:21:42,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:42,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:42,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:42,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:42,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:42,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:42,363 INFO L87 Difference]: Start difference. First operand 320 states and 438 transitions. Second operand 3 states. [2019-01-11 21:21:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:42,953 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2019-01-11 21:21:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:42,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:21:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:42,965 INFO L225 Difference]: With dead ends: 421 [2019-01-11 21:21:42,968 INFO L226 Difference]: Without dead ends: 360 [2019-01-11 21:21:42,969 INFO L631 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-01-11 21:21:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-11 21:21:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 347. [2019-01-11 21:21:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-11 21:21:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 475 transitions. [2019-01-11 21:21:43,021 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 475 transitions. Word has length 13 [2019-01-11 21:21:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:43,023 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 475 transitions. [2019-01-11 21:21:43,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 475 transitions. [2019-01-11 21:21:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:21:43,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:43,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:43,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-01-11 21:21:43,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:43,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:43,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:43,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:43,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:43,117 INFO L87 Difference]: Start difference. First operand 347 states and 475 transitions. Second operand 3 states. [2019-01-11 21:21:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:43,246 INFO L93 Difference]: Finished difference Result 542 states and 723 transitions. [2019-01-11 21:21:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:43,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:21:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:43,253 INFO L225 Difference]: With dead ends: 542 [2019-01-11 21:21:43,253 INFO L226 Difference]: Without dead ends: 354 [2019-01-11 21:21:43,254 INFO L631 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-01-11 21:21:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-11 21:21:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 303. [2019-01-11 21:21:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-01-11 21:21:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2019-01-11 21:21:43,278 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 15 [2019-01-11 21:21:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:43,278 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2019-01-11 21:21:43,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2019-01-11 21:21:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:21:43,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:43,282 INFO L402 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-01-11 21:21:43,283 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-01-11 21:21:43,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:43,362 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand 3 states. [2019-01-11 21:21:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:43,617 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2019-01-11 21:21:43,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:43,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:21:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:43,620 INFO L225 Difference]: With dead ends: 303 [2019-01-11 21:21:43,621 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 21:21:43,621 INFO L631 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-01-11 21:21:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 21:21:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-01-11 21:21:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-01-11 21:21:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2019-01-11 21:21:43,641 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 21 [2019-01-11 21:21:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:43,642 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2019-01-11 21:21:43,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2019-01-11 21:21:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:21:43,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:43,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:43,647 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-01-11 21:21:43,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:43,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:43,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:43,744 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand 3 states. [2019-01-11 21:21:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:43,843 INFO L93 Difference]: Finished difference Result 296 states and 413 transitions. [2019-01-11 21:21:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:43,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:21:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:43,845 INFO L225 Difference]: With dead ends: 296 [2019-01-11 21:21:43,846 INFO L226 Difference]: Without dead ends: 66 [2019-01-11 21:21:43,847 INFO L631 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-01-11 21:21:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-11 21:21:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-11 21:21:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 21:21:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-01-11 21:21:43,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 26 [2019-01-11 21:21:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:43,854 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-01-11 21:21:43,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-01-11 21:21:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:21:43,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:43,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:43,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:43,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-01-11 21:21:43,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:43,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:43,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:43,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:43,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:43,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:43,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:43,952 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 3 states. [2019-01-11 21:21:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:44,137 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-01-11 21:21:44,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:44,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-11 21:21:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:44,139 INFO L225 Difference]: With dead ends: 86 [2019-01-11 21:21:44,139 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 21:21:44,139 INFO L631 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-01-11 21:21:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 21:21:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 21:21:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 21:21:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-01-11 21:21:44,155 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 27 [2019-01-11 21:21:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:44,155 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-01-11 21:21:44,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-01-11 21:21:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:21:44,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:44,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:44,159 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-01-11 21:21:44,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:44,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:44,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:44,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:44,272 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 3 states. [2019-01-11 21:21:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:44,291 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-01-11 21:21:44,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:44,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-11 21:21:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:44,292 INFO L225 Difference]: With dead ends: 90 [2019-01-11 21:21:44,292 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 21:21:44,293 INFO L631 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-01-11 21:21:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 21:21:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 21:21:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 21:21:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-01-11 21:21:44,299 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-01-11 21:21:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:44,300 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-01-11 21:21:44,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-01-11 21:21:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:21:44,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:44,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:44,303 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-01-11 21:21:44,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:44,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:44,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:44,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:44,453 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 5 states. [2019-01-11 21:21:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:44,772 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2019-01-11 21:21:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:44,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-11 21:21:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:44,776 INFO L225 Difference]: With dead ends: 114 [2019-01-11 21:21:44,776 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 21:21:44,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 21:21:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-01-11 21:21:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 21:21:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-01-11 21:21:44,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 30 [2019-01-11 21:21:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:44,787 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-01-11 21:21:44,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-01-11 21:21:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:21:44,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:44,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:44,790 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-01-11 21:21:44,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:44,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:44,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:44,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:44,937 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 5 states. [2019-01-11 21:21:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:45,060 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2019-01-11 21:21:45,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:45,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-11 21:21:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:45,062 INFO L225 Difference]: With dead ends: 100 [2019-01-11 21:21:45,062 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 21:21:45,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 21:21:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2019-01-11 21:21:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 21:21:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-01-11 21:21:45,069 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 30 [2019-01-11 21:21:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:45,071 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-01-11 21:21:45,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2019-01-11 21:21:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:21:45,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:45,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:45,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-01-11 21:21:45,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:45,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:45,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:45,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:45,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:45,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:45,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:45,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:45,200 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 3 states. [2019-01-11 21:21:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:45,244 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-01-11 21:21:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:45,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-11 21:21:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:45,249 INFO L225 Difference]: With dead ends: 131 [2019-01-11 21:21:45,249 INFO L226 Difference]: Without dead ends: 127 [2019-01-11 21:21:45,249 INFO L631 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-01-11 21:21:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-11 21:21:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-01-11 21:21:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 21:21:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2019-01-11 21:21:45,260 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 31 [2019-01-11 21:21:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:45,260 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-01-11 21:21:45,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2019-01-11 21:21:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:21:45,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:45,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:45,265 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:45,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:45,265 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-01-11 21:21:45,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:45,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:45,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:45,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:21:45,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:21:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:21:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:21:45,494 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand 4 states. [2019-01-11 21:21:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:45,551 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2019-01-11 21:21:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:21:45,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-11 21:21:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:45,558 INFO L225 Difference]: With dead ends: 163 [2019-01-11 21:21:45,558 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 21:21:45,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 21:21:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 21:21:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 21:21:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-01-11 21:21:45,572 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 31 [2019-01-11 21:21:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:45,572 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-01-11 21:21:45,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:21:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-01-11 21:21:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:21:45,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:45,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:45,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-01-11 21:21:45,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:45,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:45,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:45,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:21:45,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:21:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:21:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:21:45,733 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-01-11 21:21:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:46,114 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2019-01-11 21:21:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:21:46,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-11 21:21:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:46,118 INFO L225 Difference]: With dead ends: 139 [2019-01-11 21:21:46,118 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 21:21:46,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 21:21:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 21:21:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 21:21:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-01-11 21:21:46,134 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2019-01-11 21:21:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:46,135 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-01-11 21:21:46,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:21:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-01-11 21:21:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 21:21:46,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:46,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:46,141 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-01-11 21:21:46,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:46,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:46,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:46,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:46,242 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 3 states. [2019-01-11 21:21:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:46,345 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2019-01-11 21:21:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:46,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-11 21:21:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:46,347 INFO L225 Difference]: With dead ends: 142 [2019-01-11 21:21:46,348 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 21:21:46,350 INFO L631 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-01-11 21:21:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 21:21:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2019-01-11 21:21:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 21:21:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2019-01-11 21:21:46,361 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 34 [2019-01-11 21:21:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:46,361 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-01-11 21:21:46,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2019-01-11 21:21:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 21:21:46,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:46,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:46,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-01-11 21:21:46,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:46,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:46,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:46,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:46,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:46,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:46,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:46,449 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 3 states. [2019-01-11 21:21:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:46,597 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-01-11 21:21:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:46,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-11 21:21:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:46,598 INFO L225 Difference]: With dead ends: 111 [2019-01-11 21:21:46,598 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 21:21:46,599 INFO L631 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-01-11 21:21:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 21:21:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2019-01-11 21:21:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 21:21:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-01-11 21:21:46,607 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 34 [2019-01-11 21:21:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:46,608 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-01-11 21:21:46,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-01-11 21:21:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 21:21:46,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:46,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:46,612 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-01-11 21:21:46,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:46,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:46,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:46,849 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 5 states. [2019-01-11 21:21:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:46,930 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-01-11 21:21:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:46,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-11 21:21:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:46,932 INFO L225 Difference]: With dead ends: 112 [2019-01-11 21:21:46,932 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 21:21:46,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 21:21:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2019-01-11 21:21:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 21:21:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-01-11 21:21:46,942 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2019-01-11 21:21:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:46,942 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-01-11 21:21:46,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-01-11 21:21:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 21:21:46,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:46,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:46,945 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-01-11 21:21:46,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:47,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:47,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:47,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:47,022 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 3 states. [2019-01-11 21:21:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:47,080 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-01-11 21:21:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:47,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-11 21:21:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:47,082 INFO L225 Difference]: With dead ends: 117 [2019-01-11 21:21:47,083 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 21:21:47,083 INFO L631 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-01-11 21:21:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 21:21:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 21:21:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 21:21:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-01-11 21:21:47,091 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 35 [2019-01-11 21:21:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-01-11 21:21:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-01-11 21:21:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 21:21:47,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:47,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:47,095 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-01-11 21:21:47,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:47,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:47,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:47,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:47,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:47,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:47,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:47,273 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2019-01-11 21:21:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:47,419 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-01-11 21:21:47,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:47,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-11 21:21:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:47,424 INFO L225 Difference]: With dead ends: 88 [2019-01-11 21:21:47,424 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 21:21:47,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 21:21:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 21:21:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 21:21:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-01-11 21:21:47,432 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 35 [2019-01-11 21:21:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:47,433 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-01-11 21:21:47,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-01-11 21:21:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 21:21:47,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:47,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:47,437 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1765065444, now seen corresponding path program 1 times [2019-01-11 21:21:47,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:47,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:21:47,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:47,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:47,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:47,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:47,515 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 3 states. [2019-01-11 21:21:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:47,589 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-01-11 21:21:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:47,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-11 21:21:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:47,591 INFO L225 Difference]: With dead ends: 80 [2019-01-11 21:21:47,591 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:21:47,591 INFO L631 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-01-11 21:21:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:21:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:21:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:21:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:21:47,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-01-11 21:21:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:47,592 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:21:47,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:21:47,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:21:47,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:21:47,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:47,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:48,058 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-11 21:21:48,174 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:48,328 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:48,478 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:48,596 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:48,711 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:48,818 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:49,020 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:49,275 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-11 21:21:49,444 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 21:21:50,154 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-11 21:21:50,489 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-11 21:21:51,170 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-01-11 21:21:51,170 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-01-11 21:21:51,170 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-01-11 21:21:51,170 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-01-11 21:21:51,171 INFO L444 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,171 INFO L444 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,171 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,171 INFO L448 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2019-01-11 21:21:51,171 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,172 INFO L444 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,172 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-01-11 21:21:51,172 INFO L448 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-1(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-2(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-3(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-4(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-5(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L503-6(lines 503 526) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2019-01-11 21:21:51,173 INFO L448 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2019-01-11 21:21:51,174 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,174 INFO L444 ceAbstractionStarter]: At program point L504(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,174 INFO L444 ceAbstractionStarter]: At program point L504-1(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,174 INFO L444 ceAbstractionStarter]: At program point L504-2(lines 503 526) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-01-11 21:21:51,174 INFO L444 ceAbstractionStarter]: At program point L504-3(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,174 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2019-01-11 21:21:51,174 INFO L444 ceAbstractionStarter]: At program point L504-4(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,175 INFO L444 ceAbstractionStarter]: At program point L504-5(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,176 INFO L444 ceAbstractionStarter]: At program point L504-6(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,176 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:51,176 INFO L444 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,176 INFO L448 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-01-11 21:21:51,176 INFO L448 ceAbstractionStarter]: For program point L637-1(lines 637 655) no Hoare annotation was computed. [2019-01-11 21:21:51,176 INFO L444 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,177 INFO L448 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572-1(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572-2(lines 567 574) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572-3(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572-4(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-01-11 21:21:51,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,177 INFO L444 ceAbstractionStarter]: At program point L572-5(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,178 INFO L444 ceAbstractionStarter]: At program point L572-6(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,182 INFO L444 ceAbstractionStarter]: At program point L572-7(lines 567 574) the Hoare annotation is: false [2019-01-11 21:21:51,182 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-01-11 21:21:51,182 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L444 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-01-11 21:21:51,183 INFO L444 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L640-1(lines 640 654) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L508-2(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L508-3(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,183 INFO L448 ceAbstractionStarter]: For program point L508-4(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,184 INFO L448 ceAbstractionStarter]: For program point L508-5(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,184 INFO L448 ceAbstractionStarter]: For program point L508-6(lines 508 525) no Hoare annotation was computed. [2019-01-11 21:21:51,184 INFO L444 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,184 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2019-01-11 21:21:51,184 INFO L444 ceAbstractionStarter]: At program point L575(lines 575 616) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,184 INFO L444 ceAbstractionStarter]: At program point L509(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,184 INFO L444 ceAbstractionStarter]: At program point L509-1(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,184 INFO L444 ceAbstractionStarter]: At program point L509-2(lines 508 525) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1) (= ~setEventCalled~0 1))) [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L509-3(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L509-4(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L509-5(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L509-6(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L448 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2019-01-11 21:21:51,185 INFO L444 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,185 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-01-11 21:21:51,186 INFO L448 ceAbstractionStarter]: For program point L643-1(lines 643 653) no Hoare annotation was computed. [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511-1(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511-2(lines 510 525) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511-3(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511-4(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,186 INFO L444 ceAbstractionStarter]: At program point L511-5(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,187 INFO L444 ceAbstractionStarter]: At program point L511-6(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,195 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-01-11 21:21:51,195 INFO L444 ceAbstractionStarter]: At program point L181-1(lines 1 1015) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:51,195 INFO L444 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,195 INFO L444 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,195 INFO L444 ceAbstractionStarter]: At program point L644-1(lines 637 655) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-01-11 21:21:51,196 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2019-01-11 21:21:51,197 INFO L444 ceAbstractionStarter]: At program point L53(lines 346 348) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:51,197 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2019-01-11 21:21:51,197 INFO L448 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2019-01-11 21:21:51,197 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-01-11 21:21:51,197 INFO L444 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,197 INFO L444 ceAbstractionStarter]: At program point L652-1(lines 640 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,197 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:21:51,197 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2019-01-11 21:21:51,198 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,198 INFO L444 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (<= 0 .cse0) (not (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-01-11 21:21:51,198 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,198 INFO L444 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,198 INFO L444 ceAbstractionStarter]: At program point L523-1(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L523-2(lines 487 551) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse12 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= ~MPR1~0 ~s~0)) (.cse5 (<= 0 .cse12)) (.cse6 (<= .cse12 0)) (.cse7 (<= .cse11 0)) (.cse10 (= ~setEventCalled~0 1)) (.cse9 (<= 0 .cse11))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse9)))) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L523-3(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L523-4(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L523-5(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L523-6(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L444 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,199 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L444 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L444 ceAbstractionStarter]: At program point L593-1(lines 593 597) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,200 INFO L444 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2019-01-11 21:21:51,200 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L444 ceAbstractionStarter]: At program point L661(lines 628 663) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,201 INFO L444 ceAbstractionStarter]: At program point L661-1(lines 628 663) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,201 INFO L451 ceAbstractionStarter]: At program point L463(lines 294 465) the Hoare annotation is: true [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L531-2(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,201 INFO L448 ceAbstractionStarter]: For program point L531-3(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,202 INFO L448 ceAbstractionStarter]: For program point L531-4(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L531-5(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L531-6(lines 531 548) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L532-3(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L448 ceAbstractionStarter]: For program point L532-6(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,203 INFO L444 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L532-9(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L532-12(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L532-15(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L532-18(lines 532 538) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L470-2(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L470-4(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,204 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 341) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L470-6(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L470-8(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L470-10(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L470-12(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L470-14(lines 470 476) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L444 ceAbstractionStarter]: At program point L603(lines 602 614) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,205 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-01-11 21:21:51,205 INFO L444 ceAbstractionStarter]: At program point L75(lines 329 412) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:51,206 INFO L444 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,206 INFO L444 ceAbstractionStarter]: At program point L605(lines 604 614) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-2(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-4(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-6(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-8(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-10(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L540-12(lines 540 547) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-01-11 21:21:51,206 INFO L448 ceAbstractionStarter]: For program point L673-2(lines 673 679) no Hoare annotation was computed. [2019-01-11 21:21:51,207 INFO L448 ceAbstractionStarter]: For program point L673-4(lines 673 679) no Hoare annotation was computed. [2019-01-11 21:21:51,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,215 INFO L444 ceAbstractionStarter]: At program point L1004(lines 821 1006) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,215 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2019-01-11 21:21:51,215 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L444 ceAbstractionStarter]: At program point L741(lines 688 743) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,216 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-1(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-2(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-3(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-4(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-5(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-6(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-7(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-8(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,217 INFO L448 ceAbstractionStarter]: For program point L1012-9(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,218 INFO L448 ceAbstractionStarter]: For program point L1012-10(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,221 INFO L448 ceAbstractionStarter]: For program point L1012-11(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,221 INFO L448 ceAbstractionStarter]: For program point L1012-12(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,221 INFO L448 ceAbstractionStarter]: For program point L1012-13(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,221 INFO L444 ceAbstractionStarter]: At program point L550(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,221 INFO L448 ceAbstractionStarter]: For program point L1012-14(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,221 INFO L444 ceAbstractionStarter]: At program point L550-1(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,221 INFO L448 ceAbstractionStarter]: For program point L1012-15(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L444 ceAbstractionStarter]: At program point L550-2(lines 480 552) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse12 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse4 (= ~NP~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (not (= 1 ~pended~0))) (.cse5 (<= 0 .cse12)) (.cse6 (<= .cse12 0)) (.cse7 (<= .cse11 0)) (.cse10 (= ~setEventCalled~0 1)) (.cse9 (<= 0 .cse11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse3 .cse8 .cse0 .cse1 .cse2 .cse5 (= ~MPR3~0 ~s~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse6 (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse7 .cse10 .cse9)))) [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L1012-16(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L444 ceAbstractionStarter]: At program point L550-3(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L1012-17(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L444 ceAbstractionStarter]: At program point L550-4(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L1012-18(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L1012-19(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L444 ceAbstractionStarter]: At program point L550-5(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-01-11 21:21:51,222 INFO L448 ceAbstractionStarter]: For program point L1012-20(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L444 ceAbstractionStarter]: At program point L550-6(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-21(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-22(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-23(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-24(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-25(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-26(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-27(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L448 ceAbstractionStarter]: For program point L1012-28(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,223 INFO L444 ceAbstractionStarter]: At program point L1013(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,223 INFO L444 ceAbstractionStarter]: At program point L1013-2(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,224 INFO L444 ceAbstractionStarter]: At program point L1013-3(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,226 INFO L444 ceAbstractionStarter]: At program point L1013-5(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,226 INFO L444 ceAbstractionStarter]: At program point L1013-9(lines 1 1015) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse12 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse5 (<= 0 .cse12)) (.cse6 (<= .cse12 0)) (.cse7 (<= .cse11 0)) (.cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= 0 .cse11)) (.cse8 (= ~setEventCalled~0 1)) (.cse2 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse3 (= ~compRegistered~0 1)) (.cse4 (not (= 1 ~pended~0))) (.cse0 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~NP~0 ~s~0))) (or (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~MPR3~0 ~s~0) .cse6 .cse7 .cse8 .cse9) (and (and .cse5 .cse6 .cse7 .cse1 (and .cse2 .cse3 .cse4 .cse0 .cse10) .cse9) .cse8) (and .cse2 .cse3 .cse4 .cse0 .cse10 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2019-01-11 21:21:51,226 INFO L444 ceAbstractionStarter]: At program point L1013-12(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,226 INFO L444 ceAbstractionStarter]: At program point L1013-14(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,226 INFO L444 ceAbstractionStarter]: At program point L1013-15(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,227 INFO L444 ceAbstractionStarter]: At program point L1013-17(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,227 INFO L444 ceAbstractionStarter]: At program point L1013-18(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,227 INFO L444 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-20(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-21(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-23(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-24(lines 553 566) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-25(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,228 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2019-01-11 21:21:51,228 INFO L444 ceAbstractionStarter]: At program point L1013-27(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,229 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2019-01-11 21:21:51,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-01-11 21:21:51,229 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L883(lines 882 987) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L685(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L685-1(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L685-2(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,229 INFO L444 ceAbstractionStarter]: At program point L818(lines 744 820) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,230 INFO L444 ceAbstractionStarter]: At program point L488-1(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-01-11 21:21:51,230 INFO L444 ceAbstractionStarter]: At program point L488-3(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L488-4(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,230 INFO L444 ceAbstractionStarter]: At program point L488-5(lines 488 500) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L488-6(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,230 INFO L444 ceAbstractionStarter]: At program point L488-7(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,230 INFO L448 ceAbstractionStarter]: For program point L488-8(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,231 INFO L444 ceAbstractionStarter]: At program point L488-9(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,239 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2019-01-11 21:21:51,239 INFO L448 ceAbstractionStarter]: For program point L488-10(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,239 INFO L444 ceAbstractionStarter]: At program point L488-11(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,239 INFO L448 ceAbstractionStarter]: For program point L488-12(lines 488 500) no Hoare annotation was computed. [2019-01-11 21:21:51,239 INFO L444 ceAbstractionStarter]: At program point L488-13(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,239 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L444 ceAbstractionStarter]: At program point L753-1(lines 753 765) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L444 ceAbstractionStarter]: At program point L291(lines 80 293) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-01-11 21:21:51,240 INFO L444 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L557-2(lines 557 563) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2019-01-11 21:21:51,240 INFO L448 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-1(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-2(lines 617 627) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 1) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= .cse0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse0))) [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-3(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-4(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-5(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-6(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L444 ceAbstractionStarter]: At program point L625-7(lines 617 627) the Hoare annotation is: false [2019-01-11 21:21:51,241 INFO L448 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2019-01-11 21:21:51,241 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,241 INFO L448 ceAbstractionStarter]: For program point L494-2(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,242 INFO L444 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L494-4(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L494-6(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L494-8(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L494-10(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L494-12(lines 494 498) no Hoare annotation was computed. [2019-01-11 21:21:51,244 INFO L444 ceAbstractionStarter]: At program point L891(lines 890 985) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-01-11 21:21:51,244 INFO L448 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L451 ceAbstractionStarter]: At program point L429(lines 413 462) the Hoare annotation is: true [2019-01-11 21:21:51,245 INFO L444 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-01-11 21:21:51,245 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2019-01-11 21:21:51,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:21:51 BoogieIcfgContainer [2019-01-11 21:21:51,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:21:51,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:21:51,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:21:51,334 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:21:51,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:41" (3/4) ... [2019-01-11 21:21:51,340 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:21:51,384 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2019-01-11 21:21:51,387 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2019-01-11 21:21:51,391 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-11 21:21:51,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-01-11 21:21:51,443 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-01-11 21:21:51,444 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && status == 0) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) || (((((((((((status == 0 && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) [2019-01-11 21:21:51,444 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && (((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 <= \result + 1073741802) && setEventCalled == 1)) || (((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 == returnVal2) [2019-01-11 21:21:51,445 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 == \result) && 0 == returnVal2) || ((((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) [2019-01-11 21:21:51,447 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 [2019-01-11 21:21:51,448 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-01-11 21:21:51,449 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-01-11 21:21:51,449 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((compRegistered == 1 && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && !(MPR3 == s)) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-01-11 21:21:51,654 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:21:51,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:21:51,655 INFO L168 Benchmark]: Toolchain (without parser) took 13262.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -267.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,656 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:21:51,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,657 INFO L168 Benchmark]: Boogie Preprocessor took 59.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,657 INFO L168 Benchmark]: RCFGBuilder took 2579.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,657 INFO L168 Benchmark]: TraceAbstraction took 9677.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.1 MB). Peak memory consumption was 273.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,658 INFO L168 Benchmark]: Witness Printer took 320.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:51,660 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 157.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2579.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9677.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.1 MB). Peak memory consumption was 273.1 MB. Max. memory is 11.5 GB. * Witness Printer took 320.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: 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: 413]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((compRegistered == 1 && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && !(MPR3 == s)) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: !(1 == pended) && status == 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && (((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 <= \result + 1073741802) && setEventCalled == 1)) || (((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 == returnVal2) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && status == 0) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) || (((((((((((status == 0 && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (((((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && 0 == \result) && 0 == returnVal2) || ((((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && status == 0) && compRegistered == 1) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((((status == 0 && compRegistered == 1) && !(1 == pended)) && status == 0) && NP == s) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: (!(1 == pended) && compRegistered == 0) && status == 0 - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: (((((((((status == 0 && compRegistered == 1) && !(1 == pended)) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: !(1 == pended) && status == 0 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && compRegistered == 0) && status == 0) && SKIP1 == s - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 328 locations, 29 error locations. SAFE Result, 9.5s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2592 SDtfs, 1840 SDslu, 1221 SDs, 0 SdLazy, 403 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 123 LocationsWithAnnotation, 123 PreInvPairs, 260 NumberOfFragments, 1939 HoareAnnotationTreeSize, 123 FomulaSimplifications, 1816 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 123 FomulaSimplificationsInter, 460 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 26445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...