./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 411af8a324a718637cdc1e76e82ebb1de5e49e9c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:08,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:08,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:08,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:08,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:08,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:08,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:08,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:08,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:08,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:08,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:08,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:08,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:08,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:08,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:08,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:08,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:08,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:08,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:08,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:08,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:08,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:08,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:08,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:08,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:08,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:08,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:08,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:08,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:08,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:08,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:08,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:08,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:08,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:08,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:08,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:08,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:08,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:08,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:08,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:08,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:08,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:08,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:08,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:08,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:08,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:08,188 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:08,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:08,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:08,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:08,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:08,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:08,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:08,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:08,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:08,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:08,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:08,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:08,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:08,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:08,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:08,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:08,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:08,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:08,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:08,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:08,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:08,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:08,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:08,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:08,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 411af8a324a718637cdc1e76e82ebb1de5e49e9c [2019-10-22 08:57:08,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:08,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:08,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:08,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:08,245 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:08,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-22 08:57:08,306 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/data/14cea54ab/dc08e5a261c544bf9cc5e15f245546cb/FLAG0363e4bb2 [2019-10-22 08:57:08,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:08,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-22 08:57:08,686 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/data/14cea54ab/dc08e5a261c544bf9cc5e15f245546cb/FLAG0363e4bb2 [2019-10-22 08:57:09,028 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/data/14cea54ab/dc08e5a261c544bf9cc5e15f245546cb [2019-10-22 08:57:09,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:09,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:09,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:09,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:09,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:09,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2362970f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09, skipping insertion in model container [2019-10-22 08:57:09,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,046 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:09,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:09,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:09,466 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:09,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:09,556 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:09,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09 WrapperNode [2019-10-22 08:57:09,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:09,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:09,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:09,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:09,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:09,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:09,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:09,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:09,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... [2019-10-22 08:57:09,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:09,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:09,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:09,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:09,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:09,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:09,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:09,982 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:09,990 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:09,998 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,006 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,011 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,014 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,020 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,027 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,035 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,037 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,040 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,046 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:10,867 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-10-22 08:57:10,867 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-10-22 08:57:10,867 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-10-22 08:57:10,867 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-10-22 08:57:10,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-10-22 08:57:10,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-10-22 08:57:10,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-10-22 08:57:10,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-10-22 08:57:10,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-10-22 08:57:10,871 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-10-22 08:57:10,871 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-22 08:57:10,871 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-22 08:57:10,871 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-10-22 08:57:10,871 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-10-22 08:57:10,873 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:10,873 INFO L284 CfgBuilder]: Removed 152 assume(true) statements. [2019-10-22 08:57:10,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:10 BoogieIcfgContainer [2019-10-22 08:57:10,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:10,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:10,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:10,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:10,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:09" (1/3) ... [2019-10-22 08:57:10,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c422c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:10, skipping insertion in model container [2019-10-22 08:57:10,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:09" (2/3) ... [2019-10-22 08:57:10,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c422c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:10, skipping insertion in model container [2019-10-22 08:57:10,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:10" (3/3) ... [2019-10-22 08:57:10,881 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-10-22 08:57:10,891 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:10,897 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-10-22 08:57:10,905 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-10-22 08:57:10,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:10,928 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:10,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:10,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:10,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:10,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:10,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:10,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-10-22 08:57:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:57:10,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:10,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:10,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-10-22 08:57:10,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:10,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912069964] [2019-10-22 08:57:10,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:11,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912069964] [2019-10-22 08:57:11,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880438717] [2019-10-22 08:57:11,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,133 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 3 states. [2019-10-22 08:57:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,223 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2019-10-22 08:57:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 08:57:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,244 INFO L225 Difference]: With dead ends: 574 [2019-10-22 08:57:11,244 INFO L226 Difference]: Without dead ends: 320 [2019-10-22 08:57:11,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-22 08:57:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-22 08:57:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-22 08:57:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 438 transitions. [2019-10-22 08:57:11,309 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 438 transitions. Word has length 11 [2019-10-22 08:57:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,309 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 438 transitions. [2019-10-22 08:57:11,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 438 transitions. [2019-10-22 08:57:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:57:11,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:11,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-10-22 08:57:11,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:11,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87204872] [2019-10-22 08:57:11,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:11,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87204872] [2019-10-22 08:57:11,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519567223] [2019-10-22 08:57:11,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,370 INFO L87 Difference]: Start difference. First operand 320 states and 438 transitions. Second operand 3 states. [2019-10-22 08:57:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,593 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2019-10-22 08:57:11,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 08:57:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,597 INFO L225 Difference]: With dead ends: 421 [2019-10-22 08:57:11,598 INFO L226 Difference]: Without dead ends: 360 [2019-10-22 08:57:11,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-22 08:57:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 347. [2019-10-22 08:57:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 08:57:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 475 transitions. [2019-10-22 08:57:11,636 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 475 transitions. Word has length 13 [2019-10-22 08:57:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,636 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 475 transitions. [2019-10-22 08:57:11,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 475 transitions. [2019-10-22 08:57:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:57:11,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,641 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:11,641 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-10-22 08:57:11,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:11,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676859566] [2019-10-22 08:57:11,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:11,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676859566] [2019-10-22 08:57:11,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042712613] [2019-10-22 08:57:11,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,693 INFO L87 Difference]: Start difference. First operand 347 states and 475 transitions. Second operand 3 states. [2019-10-22 08:57:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,746 INFO L93 Difference]: Finished difference Result 542 states and 723 transitions. [2019-10-22 08:57:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 08:57:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,753 INFO L225 Difference]: With dead ends: 542 [2019-10-22 08:57:11,753 INFO L226 Difference]: Without dead ends: 354 [2019-10-22 08:57:11,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-22 08:57:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 303. [2019-10-22 08:57:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-22 08:57:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2019-10-22 08:57:11,784 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 15 [2019-10-22 08:57:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,784 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2019-10-22 08:57:11,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2019-10-22 08:57:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:57:11,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,786 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:11,786 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-10-22 08:57:11,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:11,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712797680] [2019-10-22 08:57:11,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:11,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712797680] [2019-10-22 08:57:11,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208831305] [2019-10-22 08:57:11,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,836 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand 3 states. [2019-10-22 08:57:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,978 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2019-10-22 08:57:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:57:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,980 INFO L225 Difference]: With dead ends: 303 [2019-10-22 08:57:11,980 INFO L226 Difference]: Without dead ends: 289 [2019-10-22 08:57:11,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-22 08:57:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-10-22 08:57:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-22 08:57:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2019-10-22 08:57:12,024 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 21 [2019-10-22 08:57:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,024 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2019-10-22 08:57:12,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2019-10-22 08:57:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:12,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,027 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-10-22 08:57:12,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814789536] [2019-10-22 08:57:12,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814789536] [2019-10-22 08:57:12,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472550907] [2019-10-22 08:57:12,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,132 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand 3 states. [2019-10-22 08:57:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,155 INFO L93 Difference]: Finished difference Result 296 states and 413 transitions. [2019-10-22 08:57:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:57:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,157 INFO L225 Difference]: With dead ends: 296 [2019-10-22 08:57:12,157 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 08:57:12,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 08:57:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-22 08:57:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:57:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-10-22 08:57:12,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 26 [2019-10-22 08:57:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,162 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-10-22 08:57:12,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-10-22 08:57:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:57:12,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,168 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-10-22 08:57:12,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255211690] [2019-10-22 08:57:12,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255211690] [2019-10-22 08:57:12,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404046024] [2019-10-22 08:57:12,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,243 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 3 states. [2019-10-22 08:57:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,267 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-10-22 08:57:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:57:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,268 INFO L225 Difference]: With dead ends: 86 [2019-10-22 08:57:12,268 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:57:12,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:57:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-22 08:57:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 08:57:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-10-22 08:57:12,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 27 [2019-10-22 08:57:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,273 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-10-22 08:57:12,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-10-22 08:57:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:57:12,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,274 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-10-22 08:57:12,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057730648] [2019-10-22 08:57:12,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057730648] [2019-10-22 08:57:12,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634660582] [2019-10-22 08:57:12,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,326 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 3 states. [2019-10-22 08:57:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,337 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-10-22 08:57:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:57:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,338 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:57:12,339 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:57:12,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:57:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-22 08:57:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 08:57:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-10-22 08:57:12,345 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-10-22 08:57:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,345 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-10-22 08:57:12,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-10-22 08:57:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:57:12,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-10-22 08:57:12,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023866494] [2019-10-22 08:57:12,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023866494] [2019-10-22 08:57:12,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:12,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854329634] [2019-10-22 08:57:12,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:12,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:12,406 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 5 states. [2019-10-22 08:57:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,449 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2019-10-22 08:57:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:12,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 08:57:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,451 INFO L225 Difference]: With dead ends: 114 [2019-10-22 08:57:12,451 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 08:57:12,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 08:57:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-10-22 08:57:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 08:57:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-10-22 08:57:12,456 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 30 [2019-10-22 08:57:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,456 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-10-22 08:57:12,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-10-22 08:57:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:57:12,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,458 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-10-22 08:57:12,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174167951] [2019-10-22 08:57:12,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174167951] [2019-10-22 08:57:12,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:12,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643963369] [2019-10-22 08:57:12,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:12,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:12,503 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 5 states. [2019-10-22 08:57:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,546 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2019-10-22 08:57:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:12,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 08:57:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,548 INFO L225 Difference]: With dead ends: 100 [2019-10-22 08:57:12,548 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:57:12,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:57:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2019-10-22 08:57:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:57:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-10-22 08:57:12,553 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 30 [2019-10-22 08:57:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,553 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-10-22 08:57:12,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2019-10-22 08:57:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:57:12,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,554 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,554 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-10-22 08:57:12,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646688100] [2019-10-22 08:57:12,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646688100] [2019-10-22 08:57:12,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152281466] [2019-10-22 08:57:12,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,607 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 3 states. [2019-10-22 08:57:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,623 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-10-22 08:57:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 08:57:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,625 INFO L225 Difference]: With dead ends: 131 [2019-10-22 08:57:12,625 INFO L226 Difference]: Without dead ends: 127 [2019-10-22 08:57:12,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-22 08:57:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-10-22 08:57:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 08:57:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2019-10-22 08:57:12,632 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 31 [2019-10-22 08:57:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,633 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-10-22 08:57:12,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2019-10-22 08:57:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:57:12,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,634 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-10-22 08:57:12,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5216396] [2019-10-22 08:57:12,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5216396] [2019-10-22 08:57:12,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:12,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425295708] [2019-10-22 08:57:12,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:12,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:12,724 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand 4 states. [2019-10-22 08:57:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,746 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2019-10-22 08:57:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:12,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 08:57:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,747 INFO L225 Difference]: With dead ends: 163 [2019-10-22 08:57:12,748 INFO L226 Difference]: Without dead ends: 105 [2019-10-22 08:57:12,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-22 08:57:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-10-22 08:57:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 08:57:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-10-22 08:57:12,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 31 [2019-10-22 08:57:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,757 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-10-22 08:57:12,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-10-22 08:57:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:57:12,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,761 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-10-22 08:57:12,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667255362] [2019-10-22 08:57:12,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667255362] [2019-10-22 08:57:12,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:12,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901774677] [2019-10-22 08:57:12,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:12,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:12,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:12,805 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-10-22 08:57:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,845 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2019-10-22 08:57:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:12,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 08:57:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,846 INFO L225 Difference]: With dead ends: 139 [2019-10-22 08:57:12,846 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 08:57:12,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 08:57:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-10-22 08:57:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 08:57:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-10-22 08:57:12,856 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2019-10-22 08:57:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,856 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-10-22 08:57:12,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-10-22 08:57:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:57:12,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,857 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,857 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-10-22 08:57:12,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682016799] [2019-10-22 08:57:12,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682016799] [2019-10-22 08:57:12,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371468715] [2019-10-22 08:57:12,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,887 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 3 states. [2019-10-22 08:57:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,902 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2019-10-22 08:57:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 08:57:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,903 INFO L225 Difference]: With dead ends: 142 [2019-10-22 08:57:12,903 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 08:57:12,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 08:57:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2019-10-22 08:57:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-22 08:57:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2019-10-22 08:57:12,910 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 34 [2019-10-22 08:57:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,910 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-10-22 08:57:12,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2019-10-22 08:57:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:57:12,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,911 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-10-22 08:57:12,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373371454] [2019-10-22 08:57:12,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:12,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373371454] [2019-10-22 08:57:12,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118300075] [2019-10-22 08:57:12,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,941 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 3 states. [2019-10-22 08:57:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,965 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-10-22 08:57:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 08:57:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,966 INFO L225 Difference]: With dead ends: 111 [2019-10-22 08:57:12,966 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 08:57:12,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 08:57:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2019-10-22 08:57:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 08:57:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-10-22 08:57:12,974 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 34 [2019-10-22 08:57:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,974 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-10-22 08:57:12,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-10-22 08:57:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:57:12,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,975 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-10-22 08:57:12,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37529510] [2019-10-22 08:57:12,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:13,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37529510] [2019-10-22 08:57:13,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:13,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:13,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440973493] [2019-10-22 08:57:13,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:13,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:13,014 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 5 states. [2019-10-22 08:57:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,056 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-10-22 08:57:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:13,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-22 08:57:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,057 INFO L225 Difference]: With dead ends: 112 [2019-10-22 08:57:13,057 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 08:57:13,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 08:57:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2019-10-22 08:57:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 08:57:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-22 08:57:13,067 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2019-10-22 08:57:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,067 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-22 08:57:13,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-22 08:57:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:57:13,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:13,067 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:13,068 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-10-22 08:57:13,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:13,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996670782] [2019-10-22 08:57:13,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:13,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996670782] [2019-10-22 08:57:13,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:13,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:13,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251343559] [2019-10-22 08:57:13,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:13,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,096 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 3 states. [2019-10-22 08:57:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,108 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-10-22 08:57:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:13,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:57:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,109 INFO L225 Difference]: With dead ends: 117 [2019-10-22 08:57:13,109 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 08:57:13,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 08:57:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 08:57:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 08:57:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-10-22 08:57:13,116 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 35 [2019-10-22 08:57:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,116 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-10-22 08:57:13,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-10-22 08:57:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:57:13,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:13,117 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:13,117 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:13,117 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-10-22 08:57:13,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:13,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747207749] [2019-10-22 08:57:13,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:13,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747207749] [2019-10-22 08:57:13,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:13,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:13,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851515688] [2019-10-22 08:57:13,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:13,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:13,172 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2019-10-22 08:57:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,207 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-10-22 08:57:13,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:13,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-22 08:57:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,208 INFO L225 Difference]: With dead ends: 88 [2019-10-22 08:57:13,208 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 08:57:13,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 08:57:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 08:57:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 08:57:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-22 08:57:13,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 35 [2019-10-22 08:57:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,215 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-22 08:57:13,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-22 08:57:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 08:57:13,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:13,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:13,217 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1765065444, now seen corresponding path program 1 times [2019-10-22 08:57:13,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:13,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670966818] [2019-10-22 08:57:13,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:13,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670966818] [2019-10-22 08:57:13,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:13,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:13,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90154170] [2019-10-22 08:57:13,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:13,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,247 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 3 states. [2019-10-22 08:57:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,258 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-10-22 08:57:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:13,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-22 08:57:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,259 INFO L225 Difference]: With dead ends: 80 [2019-10-22 08:57:13,259 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:13,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:13,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-10-22 08:57:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,260 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:13,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:13,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:13,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:13,924 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-10-22 08:57:14,241 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-22 08:57:14,609 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-22 08:57:14,829 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-10-22 08:57:14,830 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,830 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-10-22 08:57:14,830 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-10-22 08:57:14,830 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-10-22 08:57:14,830 INFO L439 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,830 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,830 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L439 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503-1(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503-2(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503-3(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503-4(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,831 INFO L443 ceAbstractionStarter]: For program point L503-5(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L443 ceAbstractionStarter]: For program point L503-6(lines 503 526) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L443 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2019-10-22 08:57:14,832 INFO L439 ceAbstractionStarter]: At program point L504(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,832 INFO L439 ceAbstractionStarter]: At program point L504-1(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,832 INFO L439 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 (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (= 1 ~compRegistered~0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-10-22 08:57:14,832 INFO L439 ceAbstractionStarter]: At program point L504-3(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L504-4(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L504-5(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L504-6(lines 503 526) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-10-22 08:57:14,833 INFO L443 ceAbstractionStarter]: For program point L637-1(lines 637 655) no Hoare annotation was computed. [2019-10-22 08:57:14,833 INFO L439 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,833 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-1(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-2(lines 567 574) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-3(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-4(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-5(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-6(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,834 INFO L439 ceAbstractionStarter]: At program point L572-7(lines 567 574) the Hoare annotation is: false [2019-10-22 08:57:14,835 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,835 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-10-22 08:57:14,835 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L439 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-10-22 08:57:14,836 INFO L439 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L640-1(lines 640 654) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L508-2(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-10-22 08:57:14,836 INFO L443 ceAbstractionStarter]: For program point L508-3(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,837 INFO L443 ceAbstractionStarter]: For program point L508-4(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,837 INFO L443 ceAbstractionStarter]: For program point L508-5(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,837 INFO L443 ceAbstractionStarter]: For program point L508-6(lines 508 525) no Hoare annotation was computed. [2019-10-22 08:57:14,837 INFO L439 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,837 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2019-10-22 08:57:14,837 INFO L439 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-10-22 08:57:14,837 INFO L439 ceAbstractionStarter]: At program point L509(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,837 INFO L439 ceAbstractionStarter]: At program point L509-1(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,837 INFO L439 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 (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1) (= ~setEventCalled~0 1))) [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L509-3(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L509-4(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L509-5(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L509-6(lines 508 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2019-10-22 08:57:14,838 INFO L439 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,838 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-10-22 08:57:14,839 INFO L443 ceAbstractionStarter]: For program point L643-1(lines 643 653) no Hoare annotation was computed. [2019-10-22 08:57:14,839 INFO L439 ceAbstractionStarter]: At program point L511(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,839 INFO L439 ceAbstractionStarter]: At program point L511-1(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,839 INFO L439 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 (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L511-3(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L511-4(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L511-5(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L511-6(lines 510 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L181-1(lines 1 1015) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,840 INFO L439 ceAbstractionStarter]: At program point L644-1(lines 637 655) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2019-10-22 08:57:14,841 INFO L439 ceAbstractionStarter]: At program point L53(lines 346 348) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 08:57:14,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L439 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,842 INFO L439 ceAbstractionStarter]: At program point L652-1(lines 640 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:14,842 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2019-10-22 08:57:14,843 INFO L439 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 (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~s~0)) (= 1 ~compRegistered~0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-10-22 08:57:14,843 INFO L439 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,843 INFO L439 ceAbstractionStarter]: At program point L523-1(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L523-2(lines 487 551) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse13 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse11 (+ ~NP~0 4))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (<= .cse11 ~MPR1~0)) (.cse3 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse4 (not (= 1 ~pended~0))) (.cse5 (<= 0 .cse13)) (.cse6 (<= .cse13 0)) (.cse7 (= 1 ~compRegistered~0)) (.cse8 (<= .cse12 0)) (.cse10 (<= 0 .cse12)) (.cse9 (= ~setEventCalled~0 1))) (or (and .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 (<= .cse11 ~s~0) .cse8 (and .cse0 .cse3 .cse4 .cse1 .cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse10) (and .cse0 .cse1 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9)))) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L523-3(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L523-4(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L523-5(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L523-6(lines 487 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2019-10-22 08:57:14,844 INFO L439 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,844 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L439 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-10-22 08:57:14,845 INFO L439 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-10-22 08:57:14,845 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-10-22 08:57:14,845 INFO L439 ceAbstractionStarter]: At program point L661(lines 628 663) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,845 INFO L439 ceAbstractionStarter]: At program point L661-1(lines 628 663) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,845 INFO L446 ceAbstractionStarter]: At program point L463(lines 294 465) the Hoare annotation is: true [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-2(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-3(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-4(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-5(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L531-6(lines 531 548) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-10-22 08:57:14,846 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,847 INFO L443 ceAbstractionStarter]: For program point L532-3(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,847 INFO L443 ceAbstractionStarter]: For program point L532-6(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,847 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,847 INFO L439 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L532-9(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L532-12(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L532-15(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L532-18(lines 532 538) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L470-2(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L470-4(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 341) no Hoare annotation was computed. [2019-10-22 08:57:14,848 INFO L443 ceAbstractionStarter]: For program point L470-6(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L470-8(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L470-10(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L470-12(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L470-14(lines 470 476) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L439 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-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-10-22 08:57:14,849 INFO L439 ceAbstractionStarter]: At program point L75(lines 329 412) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 08:57:14,849 INFO L439 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L439 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-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-2(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-4(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-6(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-8(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-10(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L540-12(lines 540 547) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-10-22 08:57:14,850 INFO L443 ceAbstractionStarter]: For program point L673-2(lines 673 679) no Hoare annotation was computed. [2019-10-22 08:57:14,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,851 INFO L443 ceAbstractionStarter]: For program point L673-4(lines 673 679) no Hoare annotation was computed. [2019-10-22 08:57:14,851 INFO L439 ceAbstractionStarter]: At program point L1004(lines 821 1006) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,851 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L439 ceAbstractionStarter]: At program point L741(lines 688 743) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-1(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-2(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-3(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-4(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-5(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-6(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-7(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-8(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,853 INFO L443 ceAbstractionStarter]: For program point L1012-9(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-10(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-11(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-12(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-13(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L439 ceAbstractionStarter]: At program point L550(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-14(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L439 ceAbstractionStarter]: At program point L550-1(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-15(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,854 INFO L439 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 (<= 0 .cse12)) (.cse5 (<= .cse12 0)) (.cse7 (<= .cse11 0)) (.cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= 0 .cse11)) (.cse8 (= ~setEventCalled~0 1)) (.cse2 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse3 (not (= 1 ~pended~0))) (.cse0 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~NP~0 ~s~0)) (.cse6 (= 1 ~compRegistered~0))) (or (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~MPR3~0 ~s~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse5 .cse6 (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse7 .cse8 .cse9) (and (and (and .cse2 .cse3 .cse0 .cse10 .cse6) .cse4 .cse5 .cse7 .cse1 .cse9) .cse8) (and .cse2 .cse3 .cse0 .cse10 .cse6 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2019-10-22 08:57:14,854 INFO L443 ceAbstractionStarter]: For program point L1012-16(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L439 ceAbstractionStarter]: At program point L550-3(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-17(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L439 ceAbstractionStarter]: At program point L550-4(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-18(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-19(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L439 ceAbstractionStarter]: At program point L550-5(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-20(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L439 ceAbstractionStarter]: At program point L550-6(lines 480 552) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-21(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,855 INFO L443 ceAbstractionStarter]: For program point L1012-22(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-23(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-24(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-25(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-26(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-27(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L443 ceAbstractionStarter]: For program point L1012-28(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,856 INFO L439 ceAbstractionStarter]: At program point L1013(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,856 INFO L439 ceAbstractionStarter]: At program point L1013-2(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,856 INFO L439 ceAbstractionStarter]: At program point L1013-3(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,856 INFO L439 ceAbstractionStarter]: At program point L1013-5(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,857 INFO L439 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 ((.cse4 (= ~NP~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (<= 0 .cse12)) (.cse5 (<= .cse12 0)) (.cse6 (= 1 ~compRegistered~0)) (.cse7 (<= .cse11 0)) (.cse10 (= ~setEventCalled~0 1)) (.cse9 (<= 0 .cse11))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse3 .cse8 .cse0 .cse1 .cse2 (= ~MPR3~0 ~s~0) .cse5 .cse6 .cse7 .cse10 .cse9)))) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-12(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-14(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-15(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-17(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-18(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-20(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,857 INFO L439 ceAbstractionStarter]: At program point L1013-21(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,858 INFO L439 ceAbstractionStarter]: At program point L1013-23(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,858 INFO L439 ceAbstractionStarter]: At program point L1013-24(lines 553 566) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,858 INFO L439 ceAbstractionStarter]: At program point L1013-25(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,858 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2019-10-22 08:57:14,858 INFO L439 ceAbstractionStarter]: At program point L1013-27(lines 1 1015) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,858 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2019-10-22 08:57:14,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,858 INFO L439 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-10-22 08:57:14,858 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L883(lines 882 987) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L685(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L685-1(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L685-2(lines 664 687) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L818(lines 744 820) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,860 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,860 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,860 INFO L439 ceAbstractionStarter]: At program point L488-1(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L439 ceAbstractionStarter]: At program point L488-3(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L488-4(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L439 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 (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L488-6(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L439 ceAbstractionStarter]: At program point L488-7(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L488-8(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L439 ceAbstractionStarter]: At program point L488-9(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2019-10-22 08:57:14,861 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,862 INFO L443 ceAbstractionStarter]: For program point L488-10(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,862 INFO L439 ceAbstractionStarter]: At program point L488-11(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,862 INFO L443 ceAbstractionStarter]: For program point L488-12(lines 488 500) no Hoare annotation was computed. [2019-10-22 08:57:14,862 INFO L439 ceAbstractionStarter]: At program point L488-13(lines 488 500) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,862 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-10-22 08:57:14,862 INFO L439 ceAbstractionStarter]: At program point L753-1(lines 753 765) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-10-22 08:57:14,862 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-10-22 08:57:14,862 INFO L439 ceAbstractionStarter]: At program point L291(lines 80 293) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-10-22 08:57:14,862 INFO L439 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,862 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point L557-2(lines 557 563) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L443 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2019-10-22 08:57:14,863 INFO L439 ceAbstractionStarter]: At program point L625(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,863 INFO L439 ceAbstractionStarter]: At program point L625-1(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,863 INFO L439 ceAbstractionStarter]: At program point L625-2(lines 617 627) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= .cse0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse0))) [2019-10-22 08:57:14,863 INFO L439 ceAbstractionStarter]: At program point L625-3(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,863 INFO L439 ceAbstractionStarter]: At program point L625-4(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,864 INFO L439 ceAbstractionStarter]: At program point L625-5(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,864 INFO L439 ceAbstractionStarter]: At program point L625-6(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,864 INFO L439 ceAbstractionStarter]: At program point L625-7(lines 617 627) the Hoare annotation is: false [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L494-2(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L439 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L494-4(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L494-6(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,864 INFO L443 ceAbstractionStarter]: For program point L494-8(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L494-10(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L494-12(lines 494 498) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L439 ceAbstractionStarter]: At program point L891(lines 890 985) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L446 ceAbstractionStarter]: At program point L429(lines 413 462) the Hoare annotation is: true [2019-10-22 08:57:14,865 INFO L439 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-10-22 08:57:14,865 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-10-22 08:57:14,866 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2019-10-22 08:57:14,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:14 BoogieIcfgContainer [2019-10-22 08:57:14,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:14,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:14,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:14,913 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:14,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:10" (3/4) ... [2019-10-22 08:57:14,923 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:14,947 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2019-10-22 08:57:14,949 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2019-10-22 08:57:14,950 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:57:14,986 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-10-22 08:57:14,987 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-10-22 08:57:14,987 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s == MPR1 && returnVal2 <= 259) && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || (((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && NP + 4 <= s) && \result + 1073741802 <= 0) && ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 == compRegistered) && 0 == returnVal2) && 0 <= \result + 1073741802)) || (((((((((((s == MPR1 && status == 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1) [2019-10-22 08:57:14,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == status && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == returnVal2)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) [2019-10-22 08:57:14,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == \result) && 0 == returnVal2) [2019-10-22 08:57:14,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 [2019-10-22 08:57:14,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-10-22 08:57:14,989 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-10-22 08:57:14,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && !(MPR3 == s)) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-10-22 08:57:15,135 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f65bb754-737f-40e8-a96a-20cd4eaf2073/bin/uautomizer/witness.graphml [2019-10-22 08:57:15,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:15,137 INFO L168 Benchmark]: Toolchain (without parser) took 6105.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 944.5 MB in the beginning and 868.7 MB in the end (delta: 75.8 MB). Peak memory consumption was 263.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,137 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:15,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,138 INFO L168 Benchmark]: Boogie Preprocessor took 56.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,138 INFO L168 Benchmark]: RCFGBuilder took 1191.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,141 INFO L168 Benchmark]: TraceAbstraction took 4037.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 981.3 MB in the beginning and 904.1 MB in the end (delta: 77.3 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,142 INFO L168 Benchmark]: Witness Printer took 222.26 ms. Allocated memory is still 1.2 GB. Free memory was 904.1 MB in the beginning and 868.7 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:15,143 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 524.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1191.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4037.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 981.3 MB in the beginning and 904.1 MB in the end (delta: 77.3 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. * Witness Printer took 222.26 ms. Allocated memory is still 1.2 GB. Free memory was 904.1 MB in the beginning and 868.7 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 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: ((((((((!(1 == pended) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && !(MPR3 == s)) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((0 == status && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == returnVal2)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && 1 == compRegistered) && __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) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((((((((((((s == MPR1 && returnVal2 <= 259) && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || (((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && NP + 4 <= s) && \result + 1073741802 <= 0) && ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 == compRegistered) && 0 == returnVal2) && 0 <= \result + 1073741802)) || (((((((((((s == MPR1 && status == 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == \result) && 0 == returnVal2) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 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) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && 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) && 0 == compRegistered) && status == 0) && SKIP1 == s - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 328 locations, 29 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 2592 SDtfs, 1840 SDslu, 1221 SDs, 0 SdLazy, 403 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 123 LocationsWithAnnotation, 123 PreInvPairs, 260 NumberOfFragments, 1940 HoareAnnotationTreeSize, 123 FomulaSimplifications, 1748 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 123 FomulaSimplificationsInter, 605 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...