./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb0d163b15d3c265ca05b2b9dcc84c96a983bffe .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:11:40,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:11:40,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:11:40,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:11:40,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:11:40,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:11:40,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:11:40,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:11:40,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:11:40,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:11:40,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:11:40,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:11:40,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:11:40,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:11:40,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:11:40,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:11:40,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:11:40,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:11:40,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:11:40,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:11:40,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:11:40,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:11:40,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:11:40,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:11:40,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:11:40,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:11:40,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:11:40,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:11:40,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:11:40,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:11:40,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:11:40,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:11:40,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:11:40,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:11:40,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:11:40,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:11:40,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:11:40,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:11:40,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:11:40,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:11:40,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:11:40,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:11:40,896 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:11:40,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:11:40,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:11:40,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:11:40,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:11:40,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:11:40,900 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:11:40,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:11:40,901 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:11:40,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:11:40,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:11:40,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:11:40,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:11:40,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:11:40,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:11:40,903 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:11:40,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:11:40,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:11:40,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:11:40,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:11:40,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:11:40,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:11:40,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:40,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:11:40,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:11:40,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:11:40,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:11:40,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:11:40,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:11:40,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:11:40,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> fb0d163b15d3c265ca05b2b9dcc84c96a983bffe [2021-08-25 20:11:41,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:11:41,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:11:41,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:11:41,260 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:11:41,261 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:11:41,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2021-08-25 20:11:41,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de05b99ec/1eef7867dfa14e9486c1583bcfabf92f/FLAG91c5fc61d [2021-08-25 20:11:41,758 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:11:41,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2021-08-25 20:11:41,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de05b99ec/1eef7867dfa14e9486c1583bcfabf92f/FLAG91c5fc61d [2021-08-25 20:11:41,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de05b99ec/1eef7867dfa14e9486c1583bcfabf92f [2021-08-25 20:11:41,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:11:41,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:11:41,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:41,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:11:41,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:11:41,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:41" (1/1) ... [2021-08-25 20:11:41,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a064b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:41, skipping insertion in model container [2021-08-25 20:11:41,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:41" (1/1) ... [2021-08-25 20:11:41,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:11:41,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:11:41,988 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2021-08-25 20:11:41,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:41,998 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:11:42,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2021-08-25 20:11:42,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:42,092 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:11:42,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42 WrapperNode [2021-08-25 20:11:42,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:42,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:42,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:11:42,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:11:42,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:42,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:11:42,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:11:42,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:11:42,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:11:42,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:11:42,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:11:42,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:11:42,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (1/1) ... [2021-08-25 20:11:42,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:11:42,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:11:42,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:11:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:11:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:11:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:11:42,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:11:42,514 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,527 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,531 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,537 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,542 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,549 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:42,554 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:43,175 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2021-08-25 20:11:43,175 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2021-08-25 20:11:43,175 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2021-08-25 20:11:43,175 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2021-08-25 20:11:43,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2021-08-25 20:11:43,177 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-08-25 20:11:43,177 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-08-25 20:11:43,177 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-08-25 20:11:43,177 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-08-25 20:11:43,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:11:43,184 INFO L299 CfgBuilder]: Removed 78 assume(true) statements. [2021-08-25 20:11:43,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:43 BoogieIcfgContainer [2021-08-25 20:11:43,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:11:43,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:11:43,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:11:43,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:11:43,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:11:41" (1/3) ... [2021-08-25 20:11:43,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:43, skipping insertion in model container [2021-08-25 20:11:43,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:42" (2/3) ... [2021-08-25 20:11:43,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110d82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:43, skipping insertion in model container [2021-08-25 20:11:43,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:43" (3/3) ... [2021-08-25 20:11:43,193 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2021-08-25 20:11:43,197 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:11:43,197 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-08-25 20:11:43,236 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:11:43,242 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:11:43,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-08-25 20:11:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 172 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:11:43,284 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:43,285 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:43,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1311783926, now seen corresponding path program 1 times [2021-08-25 20:11:43,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:43,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771522592] [2021-08-25 20:11:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:43,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:43,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:43,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771522592] [2021-08-25 20:11:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771522592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:43,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:43,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:43,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723161521] [2021-08-25 20:11:43,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:43,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:43,526 INFO L87 Difference]: Start difference. First operand has 173 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 172 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:43,594 INFO L93 Difference]: Finished difference Result 343 states and 509 transitions. [2021-08-25 20:11:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-25 20:11:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:43,612 INFO L225 Difference]: With dead ends: 343 [2021-08-25 20:11:43,612 INFO L226 Difference]: Without dead ends: 165 [2021-08-25 20:11:43,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-25 20:11:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-08-25 20:11:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.483221476510067) internal successors, (221), 164 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2021-08-25 20:11:43,686 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 11 [2021-08-25 20:11:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:43,686 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2021-08-25 20:11:43,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2021-08-25 20:11:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:11:43,687 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:43,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:11:43,688 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -825827361, now seen corresponding path program 1 times [2021-08-25 20:11:43,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:43,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048931753] [2021-08-25 20:11:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:43,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:43,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:43,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048931753] [2021-08-25 20:11:43,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048931753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:43,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:43,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:43,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373655264] [2021-08-25 20:11:43,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:43,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:43,784 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,006 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2021-08-25 20:11:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:11:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,009 INFO L225 Difference]: With dead ends: 251 [2021-08-25 20:11:44,009 INFO L226 Difference]: Without dead ends: 200 [2021-08-25 20:11:44,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-25 20:11:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2021-08-25 20:11:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 176 states have (on average 1.4375) internal successors, (253), 186 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2021-08-25 20:11:44,023 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 13 [2021-08-25 20:11:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,023 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2021-08-25 20:11:44,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2021-08-25 20:11:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-25 20:11:44,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,024 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:44,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:11:44,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash 169161723, now seen corresponding path program 1 times [2021-08-25 20:11:44,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016316692] [2021-08-25 20:11:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016316692] [2021-08-25 20:11:44,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016316692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:44,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429173703] [2021-08-25 20:11:44,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:44,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,091 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,125 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2021-08-25 20:11:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:44,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-25 20:11:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,127 INFO L225 Difference]: With dead ends: 297 [2021-08-25 20:11:44,127 INFO L226 Difference]: Without dead ends: 214 [2021-08-25 20:11:44,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-08-25 20:11:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2021-08-25 20:11:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 169 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2021-08-25 20:11:44,139 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 14 [2021-08-25 20:11:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,140 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2021-08-25 20:11:44,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2021-08-25 20:11:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:11:44,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,141 INFO L512 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] [2021-08-25 20:11:44,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:11:44,142 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1790313284, now seen corresponding path program 1 times [2021-08-25 20:11:44,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89787139] [2021-08-25 20:11:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89787139] [2021-08-25 20:11:44,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89787139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:44,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873047043] [2021-08-25 20:11:44,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:44,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,232 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,334 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2021-08-25 20:11:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-25 20:11:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,336 INFO L225 Difference]: With dead ends: 170 [2021-08-25 20:11:44,336 INFO L226 Difference]: Without dead ends: 164 [2021-08-25 20:11:44,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-25 20:11:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-08-25 20:11:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.41875) internal successors, (227), 163 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2021-08-25 20:11:44,346 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 22 [2021-08-25 20:11:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,346 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2021-08-25 20:11:44,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2021-08-25 20:11:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 20:11:44,348 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,348 INFO L512 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] [2021-08-25 20:11:44,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:11:44,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1900059442, now seen corresponding path program 1 times [2021-08-25 20:11:44,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971764247] [2021-08-25 20:11:44,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971764247] [2021-08-25 20:11:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971764247] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:44,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083718450] [2021-08-25 20:11:44,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:44,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,421 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,534 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2021-08-25 20:11:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:44,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-25 20:11:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,536 INFO L225 Difference]: With dead ends: 208 [2021-08-25 20:11:44,536 INFO L226 Difference]: Without dead ends: 161 [2021-08-25 20:11:44,536 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-25 20:11:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-08-25 20:11:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 158 states have (on average 1.4113924050632911) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2021-08-25 20:11:44,553 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 25 [2021-08-25 20:11:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,553 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2021-08-25 20:11:44,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2021-08-25 20:11:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 20:11:44,561 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,561 INFO L512 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] [2021-08-25 20:11:44,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:11:44,562 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 88593490, now seen corresponding path program 1 times [2021-08-25 20:11:44,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898498547] [2021-08-25 20:11:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898498547] [2021-08-25 20:11:44,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898498547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:44,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595876190] [2021-08-25 20:11:44,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:44,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:44,658 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,688 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2021-08-25 20:11:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-25 20:11:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,690 INFO L225 Difference]: With dead ends: 220 [2021-08-25 20:11:44,690 INFO L226 Difference]: Without dead ends: 169 [2021-08-25 20:11:44,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-25 20:11:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2021-08-25 20:11:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 153 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2021-08-25 20:11:44,702 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 26 [2021-08-25 20:11:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,702 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2021-08-25 20:11:44,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2021-08-25 20:11:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:11:44,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,703 INFO L512 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] [2021-08-25 20:11:44,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:11:44,704 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,704 INFO L82 PathProgramCache]: Analyzing trace with hash 721476524, now seen corresponding path program 1 times [2021-08-25 20:11:44,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709143341] [2021-08-25 20:11:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709143341] [2021-08-25 20:11:44,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709143341] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:44,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024552975] [2021-08-25 20:11:44,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:44,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:44,799 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:44,890 INFO L93 Difference]: Finished difference Result 209 states and 283 transitions. [2021-08-25 20:11:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:44,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-25 20:11:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:44,891 INFO L225 Difference]: With dead ends: 209 [2021-08-25 20:11:44,891 INFO L226 Difference]: Without dead ends: 165 [2021-08-25 20:11:44,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-25 20:11:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 154. [2021-08-25 20:11:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.403973509933775) internal successors, (212), 153 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 212 transitions. [2021-08-25 20:11:44,900 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 212 transitions. Word has length 29 [2021-08-25 20:11:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:44,901 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 212 transitions. [2021-08-25 20:11:44,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 212 transitions. [2021-08-25 20:11:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:44,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:44,902 INFO L512 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] [2021-08-25 20:11:44,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:11:44,903 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2108002969, now seen corresponding path program 1 times [2021-08-25 20:11:44,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:44,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472386692] [2021-08-25 20:11:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:44,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:44,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:44,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472386692] [2021-08-25 20:11:44,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472386692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:44,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:44,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:44,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810793524] [2021-08-25 20:11:44,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:44,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:44,938 INFO L87 Difference]: Start difference. First operand 154 states and 212 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,013 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2021-08-25 20:11:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:45,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:11:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,015 INFO L225 Difference]: With dead ends: 267 [2021-08-25 20:11:45,015 INFO L226 Difference]: Without dead ends: 217 [2021-08-25 20:11:45,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-25 20:11:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 166. [2021-08-25 20:11:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.4110429447852761) internal successors, (230), 165 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2021-08-25 20:11:45,026 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 31 [2021-08-25 20:11:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,027 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2021-08-25 20:11:45,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2021-08-25 20:11:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:45,028 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,028 INFO L512 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] [2021-08-25 20:11:45,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:11:45,029 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1335601405, now seen corresponding path program 1 times [2021-08-25 20:11:45,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421096461] [2021-08-25 20:11:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:45,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:45,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421096461] [2021-08-25 20:11:45,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421096461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:45,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:45,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:45,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795602455] [2021-08-25 20:11:45,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:45,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:45,074 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,192 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2021-08-25 20:11:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:11:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,194 INFO L225 Difference]: With dead ends: 292 [2021-08-25 20:11:45,194 INFO L226 Difference]: Without dead ends: 238 [2021-08-25 20:11:45,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-08-25 20:11:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2021-08-25 20:11:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.389937106918239) internal successors, (221), 161 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 221 transitions. [2021-08-25 20:11:45,210 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 221 transitions. Word has length 31 [2021-08-25 20:11:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,210 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 221 transitions. [2021-08-25 20:11:45,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2021-08-25 20:11:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:45,211 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,211 INFO L512 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] [2021-08-25 20:11:45,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:11:45,212 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1219124044, now seen corresponding path program 1 times [2021-08-25 20:11:45,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016591258] [2021-08-25 20:11:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:45,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:45,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016591258] [2021-08-25 20:11:45,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016591258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:45,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:45,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:45,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219781963] [2021-08-25 20:11:45,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:45,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:45,260 INFO L87 Difference]: Start difference. First operand 162 states and 221 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,365 INFO L93 Difference]: Finished difference Result 194 states and 258 transitions. [2021-08-25 20:11:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:11:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,366 INFO L225 Difference]: With dead ends: 194 [2021-08-25 20:11:45,366 INFO L226 Difference]: Without dead ends: 173 [2021-08-25 20:11:45,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-25 20:11:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2021-08-25 20:11:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 161 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2021-08-25 20:11:45,379 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 31 [2021-08-25 20:11:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,380 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2021-08-25 20:11:45,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2021-08-25 20:11:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:45,382 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,382 INFO L512 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] [2021-08-25 20:11:45,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:11:45,383 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 358090674, now seen corresponding path program 1 times [2021-08-25 20:11:45,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189070839] [2021-08-25 20:11:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:45,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:45,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189070839] [2021-08-25 20:11:45,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189070839] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:45,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:45,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:45,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804446010] [2021-08-25 20:11:45,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:45,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:45,461 INFO L87 Difference]: Start difference. First operand 162 states and 215 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,583 INFO L93 Difference]: Finished difference Result 241 states and 305 transitions. [2021-08-25 20:11:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:11:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,587 INFO L225 Difference]: With dead ends: 241 [2021-08-25 20:11:45,587 INFO L226 Difference]: Without dead ends: 220 [2021-08-25 20:11:45,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-25 20:11:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 166. [2021-08-25 20:11:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.3374233128834356) internal successors, (218), 165 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2021-08-25 20:11:45,603 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 32 [2021-08-25 20:11:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,603 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2021-08-25 20:11:45,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2021-08-25 20:11:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:45,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,604 INFO L512 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] [2021-08-25 20:11:45,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:11:45,605 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash 316074378, now seen corresponding path program 1 times [2021-08-25 20:11:45,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345467604] [2021-08-25 20:11:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:45,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:45,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345467604] [2021-08-25 20:11:45,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345467604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:45,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:45,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:45,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019231830] [2021-08-25 20:11:45,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:45,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:45,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:45,653 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,721 INFO L93 Difference]: Finished difference Result 221 states and 283 transitions. [2021-08-25 20:11:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:11:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,723 INFO L225 Difference]: With dead ends: 221 [2021-08-25 20:11:45,723 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:11:45,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:11:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2021-08-25 20:11:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 171 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2021-08-25 20:11:45,736 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 32 [2021-08-25 20:11:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,737 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2021-08-25 20:11:45,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2021-08-25 20:11:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:45,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,739 INFO L512 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] [2021-08-25 20:11:45,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:11:45,739 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1791632684, now seen corresponding path program 1 times [2021-08-25 20:11:45,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268985976] [2021-08-25 20:11:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:45,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:45,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268985976] [2021-08-25 20:11:45,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268985976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:45,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:45,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:45,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276600725] [2021-08-25 20:11:45,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:45,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:45,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:45,843 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:45,955 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2021-08-25 20:11:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-25 20:11:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:45,956 INFO L225 Difference]: With dead ends: 242 [2021-08-25 20:11:45,957 INFO L226 Difference]: Without dead ends: 205 [2021-08-25 20:11:45,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-25 20:11:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2021-08-25 20:11:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2857142857142858) internal successors, (207), 162 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2021-08-25 20:11:45,970 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 33 [2021-08-25 20:11:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:45,970 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2021-08-25 20:11:45,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2021-08-25 20:11:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:45,971 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:45,971 INFO L512 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] [2021-08-25 20:11:45,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:11:45,972 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1200712151, now seen corresponding path program 1 times [2021-08-25 20:11:45,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:45,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276161659] [2021-08-25 20:11:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:45,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:46,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:46,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276161659] [2021-08-25 20:11:46,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276161659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:46,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:46,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:46,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061412180] [2021-08-25 20:11:46,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:46,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:46,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:46,002 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:46,027 INFO L93 Difference]: Finished difference Result 205 states and 258 transitions. [2021-08-25 20:11:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-25 20:11:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:46,028 INFO L225 Difference]: With dead ends: 205 [2021-08-25 20:11:46,028 INFO L226 Difference]: Without dead ends: 177 [2021-08-25 20:11:46,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-25 20:11:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2021-08-25 20:11:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 158 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2021-08-25 20:11:46,043 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 33 [2021-08-25 20:11:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:46,044 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2021-08-25 20:11:46,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2021-08-25 20:11:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:46,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:46,045 INFO L512 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] [2021-08-25 20:11:46,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:11:46,045 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2021-08-25 20:11:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 79667417, now seen corresponding path program 1 times [2021-08-25 20:11:46,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:46,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256852382] [2021-08-25 20:11:46,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:46,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:46,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:46,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256852382] [2021-08-25 20:11:46,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256852382] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:46,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:46,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:46,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429781996] [2021-08-25 20:11:46,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:46,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:46,092 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:46,116 INFO L93 Difference]: Finished difference Result 167 states and 213 transitions. [2021-08-25 20:11:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-25 20:11:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:46,117 INFO L225 Difference]: With dead ends: 167 [2021-08-25 20:11:46,117 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:11:46,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:11:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:11:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:11:46,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2021-08-25 20:11:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:46,119 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:11:46,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:11:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:11:46,121 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,122 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,122 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,122 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,122 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,123 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,123 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,123 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,123 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,124 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,124 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,124 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,124 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,124 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,125 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,125 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:46,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:11:46,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:11:46,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:46,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:48,312 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,313 INFO L853 garLoopResultBuilder]: At program point L498(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 1)) (.cse1 (<= 5 ~MPR1~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= ULTIMATE.start_main_~__cil_tmp8~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (= ~pended~0 0))) (or (and (not (= 259 |ULTIMATE.start_IofCallDriver_#res|)) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s~0 ~NP~0) .cse5 .cse6 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse7) (and .cse0 .cse1 (<= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse2 .cse3 .cse4 .cse5 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse6 .cse7 (= ~MPR3~0 ~s~0)))) [2021-08-25 20:11:48,313 INFO L853 garLoopResultBuilder]: At program point L498-1(lines 437 500) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,313 INFO L853 garLoopResultBuilder]: At program point L498-2(lines 437 500) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,313 INFO L853 garLoopResultBuilder]: At program point L498-3(lines 437 500) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,314 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2021-08-25 20:11:48,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,314 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2021-08-25 20:11:48,314 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2021-08-25 20:11:48,314 INFO L853 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,314 INFO L853 garLoopResultBuilder]: At program point L70(lines 323 368) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~s~0 1))) [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2021-08-25 20:11:48,315 INFO L853 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,315 INFO L853 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: false [2021-08-25 20:11:48,315 INFO L857 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2021-08-25 20:11:48,316 INFO L853 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~MPR1~0 ~s~0)) [2021-08-25 20:11:48,316 INFO L853 garLoopResultBuilder]: At program point L471-1(lines 444 499) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,316 INFO L853 garLoopResultBuilder]: At program point L471-2(lines 444 499) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,316 INFO L857 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2021-08-25 20:11:48,316 INFO L853 garLoopResultBuilder]: At program point L471-3(lines 444 499) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,316 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L853 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,317 INFO L857 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2021-08-25 20:11:48,318 INFO L853 garLoopResultBuilder]: At program point L176-1(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,318 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,318 INFO L853 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,318 INFO L853 garLoopResultBuilder]: At program point L573-1(lines 565 575) the Hoare annotation is: false [2021-08-25 20:11:48,318 INFO L853 garLoopResultBuilder]: At program point L573-2(lines 565 575) the Hoare annotation is: false [2021-08-25 20:11:48,318 INFO L853 garLoopResultBuilder]: At program point L573-3(lines 565 575) the Hoare annotation is: false [2021-08-25 20:11:48,318 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2021-08-25 20:11:48,319 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2021-08-25 20:11:48,319 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,319 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2021-08-25 20:11:48,319 INFO L853 garLoopResultBuilder]: At program point L541-1(lines 541 545) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0 259) (<= 5 ~MPR1~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_KbFilter_PnP_~status~0 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~NP~0 1) (= ~pended~0 0) (< 258 ULTIMATE.start_KbFilter_PnP_~status~0)) [2021-08-25 20:11:48,319 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2021-08-25 20:11:48,319 INFO L853 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2021-08-25 20:11:48,320 INFO L853 garLoopResultBuilder]: At program point L48(lines 340 345) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,320 INFO L857 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2021-08-25 20:11:48,321 INFO L853 garLoopResultBuilder]: At program point L445-1(lines 445 448) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~MPR1~0 ~s~0)) [2021-08-25 20:11:48,321 INFO L857 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2021-08-25 20:11:48,321 INFO L853 garLoopResultBuilder]: At program point L445-3(lines 445 448) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,321 INFO L857 garLoopResultBuilder]: For program point L445-4(lines 445 448) no Hoare annotation was computed. [2021-08-25 20:11:48,321 INFO L853 garLoopResultBuilder]: At program point L445-5(lines 445 448) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,321 INFO L857 garLoopResultBuilder]: For program point L445-6(lines 445 448) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L853 garLoopResultBuilder]: At program point L445-7(lines 445 448) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L479-1(lines 479 496) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L479-2(lines 479 496) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L479-3(lines 479 496) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L480-3(lines 480 486) no Hoare annotation was computed. [2021-08-25 20:11:48,322 INFO L857 garLoopResultBuilder]: For program point L480-6(lines 480 486) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L480-9(lines 480 486) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L581-1(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,323 INFO L857 garLoopResultBuilder]: For program point L581-2(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-3(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-4(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-5(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-6(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-7(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-8(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,324 INFO L857 garLoopResultBuilder]: For program point L581-9(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-10(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-11(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-12(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-13(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-14(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L857 garLoopResultBuilder]: For program point L581-15(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,325 INFO L853 garLoopResultBuilder]: At program point L582-3(lines 1 584) the Hoare annotation is: (let ((.cse0 (= ~setEventCalled~0 1)) (.cse1 (<= 5 ~MPR1~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= ULTIMATE.start_main_~__cil_tmp8~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse6 .cse7 (= ~MPR3~0 ~s~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s~0 ~NP~0) .cse5 .cse6 (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse7))) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L582-6(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L582-8(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L582-9(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L582-11(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,326 INFO L853 garLoopResultBuilder]: At program point L582-12(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L853 garLoopResultBuilder]: At program point L582-14(lines 1 584) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 451 474) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,327 INFO L857 garLoopResultBuilder]: For program point L451-2(lines 451 474) no Hoare annotation was computed. [2021-08-25 20:11:48,328 INFO L860 garLoopResultBuilder]: At program point L385(lines 369 418) the Hoare annotation is: true [2021-08-25 20:11:48,328 INFO L857 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2021-08-25 20:11:48,328 INFO L857 garLoopResultBuilder]: For program point L451-3(lines 451 474) no Hoare annotation was computed. [2021-08-25 20:11:48,328 INFO L853 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0 259) (<= 5 ~MPR1~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_KbFilter_PnP_~status~0 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~NP~0 1) (= ~pended~0 0) (< 258 ULTIMATE.start_KbFilter_PnP_~status~0)) [2021-08-25 20:11:48,328 INFO L853 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~MPR1~0 ~s~0)) [2021-08-25 20:11:48,328 INFO L853 garLoopResultBuilder]: At program point L452-1(lines 451 474) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,329 INFO L853 garLoopResultBuilder]: At program point L452-2(lines 451 474) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,329 INFO L857 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2021-08-25 20:11:48,329 INFO L853 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,329 INFO L853 garLoopResultBuilder]: At program point L452-3(lines 451 474) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,329 INFO L860 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2021-08-25 20:11:48,329 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2021-08-25 20:11:48,329 INFO L857 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2021-08-25 20:11:48,330 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2021-08-25 20:11:48,330 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,330 INFO L853 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0 259) (<= 5 ~MPR1~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_KbFilter_PnP_~status~0 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~NP~0 1) (= ~pended~0 0) (< 258 ULTIMATE.start_KbFilter_PnP_~status~0)) [2021-08-25 20:11:48,330 INFO L853 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,330 INFO L853 garLoopResultBuilder]: At program point L520-1(lines 515 522) the Hoare annotation is: false [2021-08-25 20:11:48,330 INFO L853 garLoopResultBuilder]: At program point L520-2(lines 515 522) the Hoare annotation is: false [2021-08-25 20:11:48,330 INFO L853 garLoopResultBuilder]: At program point L520-3(lines 515 522) the Hoare annotation is: false [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L853 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point L488-2(lines 488 495) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2021-08-25 20:11:48,331 INFO L857 garLoopResultBuilder]: For program point L488-4(lines 488 495) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L853 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L488-6(lines 488 495) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 456 473) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L456-2(lines 456 473) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L456-3(lines 456 473) no Hoare annotation was computed. [2021-08-25 20:11:48,332 INFO L857 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2021-08-25 20:11:48,333 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2021-08-25 20:11:48,333 INFO L857 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2021-08-25 20:11:48,333 INFO L857 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2021-08-25 20:11:48,333 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,333 INFO L853 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~__cil_tmp23~0 259) (<= 5 ~MPR1~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_KbFilter_PnP_~status~0 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (= ~NP~0 1) (= ~pended~0 0) (< 258 ULTIMATE.start_KbFilter_PnP_~status~0)) [2021-08-25 20:11:48,333 INFO L853 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~MPR1~0 ~s~0)) [2021-08-25 20:11:48,333 INFO L853 garLoopResultBuilder]: At program point L457-1(lines 456 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L457-2(lines 456 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L457-3(lines 456 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,334 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~MPR1~0 ~s~0)) [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L459-1(lines 458 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L459-2(lines 458 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,334 INFO L853 garLoopResultBuilder]: At program point L459-3(lines 458 473) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L427-2(lines 427 433) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L427-4(lines 427 433) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L853 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L427-6(lines 427 433) no Hoare annotation was computed. [2021-08-25 20:11:48,335 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:11:48,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,336 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2021-08-25 20:11:48,336 INFO L853 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-08-25 20:11:48,336 INFO L853 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ULTIMATE.start_main_~__cil_tmp8~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-08-25 20:11:48,336 INFO L857 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2021-08-25 20:11:48,336 INFO L857 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2021-08-25 20:11:48,336 INFO L857 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2021-08-25 20:11:48,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-08-25 20:11:48,337 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2021-08-25 20:11:48,337 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2021-08-25 20:11:48,337 INFO L857 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2021-08-25 20:11:48,337 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2021-08-25 20:11:48,341 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:11:48,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:11:48 BoogieIcfgContainer [2021-08-25 20:11:48,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:11:48,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:11:48,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:11:48,375 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:11:48,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:43" (3/4) ... [2021-08-25 20:11:48,378 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:11:48,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2021-08-25 20:11:48,406 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-08-25 20:11:48,407 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-25 20:11:48,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:11:48,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(259 == \result) && setEventCalled == 1) && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && !(259 == returnVal2)) && pended == 0) || ((((((((((((setEventCalled == 1 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && MPR3 == s) [2021-08-25 20:11:48,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status [2021-08-25 20:11:48,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status [2021-08-25 20:11:48,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status [2021-08-25 20:11:48,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status [2021-08-25 20:11:48,516 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:11:48,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:11:48,518 INFO L168 Benchmark]: Toolchain (without parser) took 6733.34 ms. Allocated memory was 56.6 MB in the beginning and 146.8 MB in the end (delta: 90.2 MB). Free memory was 40.8 MB in the beginning and 119.0 MB in the end (delta: -78.2 MB). Peak memory consumption was 90.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,518 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 44.0 MB. Free memory was 26.0 MB in the beginning and 26.0 MB in the end (delta: 42.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:48,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.33 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 37.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.11 ms. Allocated memory is still 56.6 MB. Free memory was 37.5 MB in the beginning and 34.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,519 INFO L168 Benchmark]: Boogie Preprocessor took 65.94 ms. Allocated memory is still 56.6 MB. Free memory was 34.0 MB in the beginning and 31.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,519 INFO L168 Benchmark]: RCFGBuilder took 966.19 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.6 MB in the beginning and 46.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,520 INFO L168 Benchmark]: TraceAbstraction took 5186.91 ms. Allocated memory was 69.2 MB in the beginning and 146.8 MB in the end (delta: 77.6 MB). Free memory was 45.7 MB in the beginning and 49.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 82.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,520 INFO L168 Benchmark]: Witness Printer took 141.12 ms. Allocated memory is still 146.8 MB. Free memory was 49.8 MB in the beginning and 119.0 MB in the end (delta: -69.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:48,522 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 44.0 MB. Free memory was 26.0 MB in the beginning and 26.0 MB in the end (delta: 42.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 308.33 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 37.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.11 ms. Allocated memory is still 56.6 MB. Free memory was 37.5 MB in the beginning and 34.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.94 ms. Allocated memory is still 56.6 MB. Free memory was 34.0 MB in the beginning and 31.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 966.19 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.6 MB in the beginning and 46.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5186.91 ms. Allocated memory was 69.2 MB in the beginning and 146.8 MB in the end (delta: 77.6 MB). Free memory was 45.7 MB in the beginning and 49.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 82.9 MB. Max. memory is 16.1 GB. * Witness Printer took 141.12 ms. Allocated memory is still 146.8 MB. Free memory was 49.8 MB in the beginning and 119.0 MB in the end (delta: -69.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 173 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5106.1ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 47.2ms, AutomataDifference: 1392.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2186.4ms, InitialAbstractionConstructionTime: 11.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2812 SDtfs, 1892 SDslu, 2571 SDs, 0 SdLazy, 721 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 721.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 173.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=2, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 218.0ms AutomataMinimizationTime, 15 MinimizatonAttempts, 344 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 61 LocationsWithAnnotation, 61 PreInvPairs, 139 NumberOfFragments, 1431 HoareAnnotationTreeSize, 61 FomulaSimplifications, 87310 FormulaSimplificationTreeSizeReduction, 358.7ms HoareSimplificationTime, 61 FomulaSimplificationsInter, 13571 FormulaSimplificationTreeSizeReductionInter, 1807.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 47.2ms SsaConstructionTime, 223.3ms SatisfiabilityAnalysisTime, 695.0ms InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && __cil_tmp8 == 1) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 541]: Loop Invariant Derived loop invariant: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && MPR1 == s - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && MPR1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && __cil_tmp8 == 1) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && MPR1 == s - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: ((((((((((!(259 == \result) && setEventCalled == 1) && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && !(259 == returnVal2)) && pended == 0) || ((((((((((((setEventCalled == 1 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && MPR3 == s) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && __cil_tmp8 == 1) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && MPR1 == s - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((((__cil_tmp23 == 259 && 5 <= MPR1) && 259 <= \result) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && 259 <= returnVal2) && \result <= 259) && status <= 259) && returnVal2 <= 259) && NP == 1) && pended == 0) && 258 < status - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && 259 <= returnVal2) && returnVal2 <= 259) && NP == 1) && pended == 0) && MPR3 == s) || (((((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && !(259 == returnVal2)) && pended == 0) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && MPR1 == s - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: (((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && __cil_tmp8 == 1) && status == 0) && s == NP) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && __cil_tmp8 == 1) && 3 <= SKIP1) && NP == 1) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && __cil_tmp8 == 1) && status == 0) && 3 <= SKIP1) && NP == 1) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && status == 0) && 3 <= SKIP1) && NP == 1) && pended == 0) && compRegistered == 0) && !(s == 1) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:11:48,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...