/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 12:04:40,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 12:04:40,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 12:04:40,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 12:04:40,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 12:04:40,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 12:04:40,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 12:04:40,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 12:04:40,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 12:04:40,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 12:04:40,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 12:04:40,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 12:04:40,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 12:04:40,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 12:04:40,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 12:04:40,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 12:04:40,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 12:04:40,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 12:04:40,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 12:04:40,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 12:04:40,105 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 12:04:40,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 12:04:40,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 12:04:40,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 12:04:40,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 12:04:40,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 12:04:40,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 12:04:40,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 12:04:40,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 12:04:40,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 12:04:40,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 12:04:40,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 12:04:40,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 12:04:40,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 12:04:40,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 12:04:40,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 12:04:40,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 12:04:40,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 12:04:40,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 12:04:40,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 12:04:40,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 12:04:40,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 12:04:40,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-20 12:04:40,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 12:04:40,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 12:04:40,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 12:04:40,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 12:04:40,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 12:04:40,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 12:04:40,151 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 12:04:40,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 12:04:40,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 12:04:40,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 12:04:40,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 12:04:40,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 12:04:40,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 12:04:40,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 12:04:40,155 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 12:04:40,155 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 12:04:40,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 12:04:40,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 12:04:40,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 12:04:40,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 12:04:40,388 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 12:04:40,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-03-20 12:04:40,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b142f7d/1e28f969ee8246b29069f99fe5828240/FLAGdcc5cd974 [2022-03-20 12:04:40,826 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 12:04:40,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-03-20 12:04:40,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b142f7d/1e28f969ee8246b29069f99fe5828240/FLAGdcc5cd974 [2022-03-20 12:04:40,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b142f7d/1e28f969ee8246b29069f99fe5828240 [2022-03-20 12:04:40,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 12:04:40,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 12:04:40,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 12:04:40,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 12:04:40,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 12:04:40,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:04:40" (1/1) ... [2022-03-20 12:04:40,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fccf3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:40, skipping insertion in model container [2022-03-20 12:04:40,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:04:40" (1/1) ... [2022-03-20 12:04:40,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 12:04:40,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 12:04:41,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-03-20 12:04:41,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 12:04:41,058 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 12:04:41,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-03-20 12:04:41,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 12:04:41,111 INFO L208 MainTranslator]: Completed translation [2022-03-20 12:04:41,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41 WrapperNode [2022-03-20 12:04:41,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 12:04:41,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 12:04:41,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 12:04:41,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 12:04:41,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 12:04:41,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 12:04:41,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 12:04:41,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 12:04:41,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 12:04:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 12:04:41,191 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) [2022-03-20 12:04:41,206 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 [2022-03-20 12:04:41,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 12:04:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 12:04:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 12:04:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 12:04:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 12:04:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-20 12:04:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 12:04:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 12:04:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 12:04:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 12:04:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 12:04:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 12:04:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 12:04:41,286 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 12:04:41,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 12:04:41,364 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:41,493 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-03-20 12:04:41,494 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-03-20 12:04:41,495 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:41,524 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-03-20 12:04:41,524 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-03-20 12:04:41,534 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:41,544 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 12:04:41,545 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 12:04:41,552 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:41,620 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-20 12:04:41,620 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-20 12:04:41,623 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 12:04:41,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 12:04:41,629 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-20 12:04:41,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:41 BoogieIcfgContainer [2022-03-20 12:04:41,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 12:04:41,631 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 12:04:41,631 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 12:04:41,632 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 12:04:41,634 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:41" (1/1) ... [2022-03-20 12:04:41,636 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 12:04:41,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 12:04:41 BasicIcfg [2022-03-20 12:04:41,656 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 12:04:41,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 12:04:41,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 12:04:41,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 12:04:41,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 12:04:40" (1/4) ... [2022-03-20 12:04:41,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1bb23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:04:41, skipping insertion in model container [2022-03-20 12:04:41,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:41" (2/4) ... [2022-03-20 12:04:41,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1bb23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:04:41, skipping insertion in model container [2022-03-20 12:04:41,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:41" (3/4) ... [2022-03-20 12:04:41,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1bb23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:04:41, skipping insertion in model container [2022-03-20 12:04:41,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 12:04:41" (4/4) ... [2022-03-20 12:04:41,663 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.cqvasr [2022-03-20 12:04:41,666 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 12:04:41,667 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 12:04:41,720 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 12:04:41,727 INFO L340 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, mAutomataTypeConcurrency=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 [2022-03-20 12:04:41,728 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 12:04:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-20 12:04:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 12:04:41,757 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:41,757 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:41,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1155157574, now seen corresponding path program 1 times [2022-03-20 12:04:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:41,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997621203] [2022-03-20 12:04:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997621203] [2022-03-20 12:04:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997621203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 12:04:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555350640] [2022-03-20 12:04:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:42,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 12:04:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 12:04:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 12:04:42,160 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 12:04:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:42,579 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-03-20 12:04:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 12:04:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-20 12:04:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:42,588 INFO L225 Difference]: With dead ends: 302 [2022-03-20 12:04:42,588 INFO L226 Difference]: Without dead ends: 157 [2022-03-20 12:04:42,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 12:04:42,594 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:42,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 12:04:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-20 12:04:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-03-20 12:04:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-20 12:04:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-03-20 12:04:42,631 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-03-20 12:04:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:42,631 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-03-20 12:04:42,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 12:04:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-03-20 12:04:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 12:04:42,632 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:42,633 INFO L499 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] [2022-03-20 12:04:42,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 12:04:42,633 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1515864402, now seen corresponding path program 1 times [2022-03-20 12:04:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602745560] [2022-03-20 12:04:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:42,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602745560] [2022-03-20 12:04:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602745560] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:42,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:42,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:04:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073711169] [2022-03-20 12:04:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:42,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:04:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:04:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:04:42,768 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:43,092 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-03-20 12:04:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 12:04:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-03-20 12:04:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:43,096 INFO L225 Difference]: With dead ends: 275 [2022-03-20 12:04:43,096 INFO L226 Difference]: Without dead ends: 219 [2022-03-20 12:04:43,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 12:04:43,097 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 318 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:43,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 266 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:04:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-20 12:04:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-03-20 12:04:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-03-20 12:04:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-03-20 12:04:43,117 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-03-20 12:04:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:43,117 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-03-20 12:04:43,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-03-20 12:04:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 12:04:43,118 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:43,118 INFO L499 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] [2022-03-20 12:04:43,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 12:04:43,119 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 252875622, now seen corresponding path program 1 times [2022-03-20 12:04:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611702755] [2022-03-20 12:04:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611702755] [2022-03-20 12:04:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611702755] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:43,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:43,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:04:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958137141] [2022-03-20 12:04:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:43,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:04:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:04:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:04:43,235 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:43,434 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-03-20 12:04:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 12:04:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-03-20 12:04:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:43,436 INFO L225 Difference]: With dead ends: 316 [2022-03-20 12:04:43,436 INFO L226 Difference]: Without dead ends: 254 [2022-03-20 12:04:43,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 12:04:43,438 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 320 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:43,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 242 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-20 12:04:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-03-20 12:04:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 12:04:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-03-20 12:04:43,484 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-03-20 12:04:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:43,484 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-03-20 12:04:43,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-03-20 12:04:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 12:04:43,485 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:43,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:43,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 12:04:43,486 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -301837211, now seen corresponding path program 1 times [2022-03-20 12:04:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354748962] [2022-03-20 12:04:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:43,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354748962] [2022-03-20 12:04:43,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354748962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:43,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:43,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:04:43,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465483778] [2022-03-20 12:04:43,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:43,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:04:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:04:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:04:43,607 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:43,816 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-03-20 12:04:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 12:04:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-03-20 12:04:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:43,825 INFO L225 Difference]: With dead ends: 220 [2022-03-20 12:04:43,825 INFO L226 Difference]: Without dead ends: 217 [2022-03-20 12:04:43,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 12:04:43,838 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 170 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:43,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 242 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:04:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-03-20 12:04:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-03-20 12:04:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 12:04:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-03-20 12:04:43,850 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-03-20 12:04:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:43,850 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-03-20 12:04:43,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-03-20 12:04:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 12:04:43,852 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:43,852 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:43,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 12:04:43,852 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -141227467, now seen corresponding path program 1 times [2022-03-20 12:04:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:43,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521097840] [2022-03-20 12:04:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521097840] [2022-03-20 12:04:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521097840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:43,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:04:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358876705] [2022-03-20 12:04:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:43,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:04:43,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:04:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:43,987 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 12:04:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:44,418 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-03-20 12:04:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:04:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-03-20 12:04:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:44,420 INFO L225 Difference]: With dead ends: 274 [2022-03-20 12:04:44,420 INFO L226 Difference]: Without dead ends: 208 [2022-03-20 12:04:44,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 12:04:44,424 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 299 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:44,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 436 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 12:04:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-20 12:04:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-03-20 12:04:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 12:04:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-03-20 12:04:44,435 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-03-20 12:04:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:44,435 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-03-20 12:04:44,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 12:04:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-03-20 12:04:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 12:04:44,437 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:44,437 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:44,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 12:04:44,437 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1455239378, now seen corresponding path program 1 times [2022-03-20 12:04:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109421140] [2022-03-20 12:04:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 12:04:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 12:04:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109421140] [2022-03-20 12:04:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109421140] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:44,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 12:04:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953584904] [2022-03-20 12:04:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:44,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 12:04:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 12:04:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:04:44,581 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 12:04:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:44,866 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-03-20 12:04:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 12:04:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-03-20 12:04:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:44,868 INFO L225 Difference]: With dead ends: 258 [2022-03-20 12:04:44,868 INFO L226 Difference]: Without dead ends: 197 [2022-03-20 12:04:44,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:04:44,869 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 269 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:44,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 361 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:04:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-20 12:04:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-03-20 12:04:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 12:04:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-03-20 12:04:44,879 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-03-20 12:04:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:44,879 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-03-20 12:04:44,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 12:04:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-03-20 12:04:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 12:04:44,880 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:44,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:44,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 12:04:44,880 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1069507529, now seen corresponding path program 1 times [2022-03-20 12:04:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:44,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011422005] [2022-03-20 12:04:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 12:04:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011422005] [2022-03-20 12:04:45,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011422005] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:45,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:45,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:04:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143536798] [2022-03-20 12:04:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:45,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:04:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:45,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:04:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:45,033 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 12:04:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:45,576 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-03-20 12:04:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 12:04:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-20 12:04:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:45,578 INFO L225 Difference]: With dead ends: 234 [2022-03-20 12:04:45,578 INFO L226 Difference]: Without dead ends: 210 [2022-03-20 12:04:45,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-20 12:04:45,579 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 399 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:45,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 452 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 12:04:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-20 12:04:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-03-20 12:04:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-03-20 12:04:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-03-20 12:04:45,588 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-03-20 12:04:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:45,610 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-03-20 12:04:45,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 12:04:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-03-20 12:04:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 12:04:45,612 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:45,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:45,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 12:04:45,613 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1382255258, now seen corresponding path program 1 times [2022-03-20 12:04:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:45,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239349333] [2022-03-20 12:04:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 12:04:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:45,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239349333] [2022-03-20 12:04:45,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239349333] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:45,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:45,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 12:04:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479415100] [2022-03-20 12:04:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:45,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 12:04:45,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 12:04:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:45,818 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 12:04:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:46,325 INFO L93 Difference]: Finished difference Result 218 states and 280 transitions. [2022-03-20 12:04:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 12:04:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-03-20 12:04:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:46,326 INFO L225 Difference]: With dead ends: 218 [2022-03-20 12:04:46,326 INFO L226 Difference]: Without dead ends: 182 [2022-03-20 12:04:46,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-03-20 12:04:46,327 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 256 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:46,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 412 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 12:04:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-20 12:04:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2022-03-20 12:04:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.352112676056338) internal successors, (192), 146 states have internal predecessors, (192), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-03-20 12:04:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 228 transitions. [2022-03-20 12:04:46,337 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 228 transitions. Word has length 52 [2022-03-20 12:04:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:46,337 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 228 transitions. [2022-03-20 12:04:46,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 12:04:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 228 transitions. [2022-03-20 12:04:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 12:04:46,338 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:46,338 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:46,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 12:04:46,338 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash -459288966, now seen corresponding path program 1 times [2022-03-20 12:04:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517497327] [2022-03-20 12:04:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 12:04:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:46,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517497327] [2022-03-20 12:04:46,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517497327] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:46,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:46,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 12:04:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902822541] [2022-03-20 12:04:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:46,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 12:04:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 12:04:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 12:04:46,465 INFO L87 Difference]: Start difference. First operand 176 states and 228 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:04:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:46,747 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2022-03-20 12:04:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 12:04:46,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-03-20 12:04:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:46,749 INFO L225 Difference]: With dead ends: 191 [2022-03-20 12:04:46,749 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 12:04:46,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:46,751 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 590 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:46,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 235 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:04:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 12:04:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 12:04:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 12:04:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-03-20 12:04:46,760 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-03-20 12:04:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:46,760 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-03-20 12:04:46,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:04:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-03-20 12:04:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 12:04:46,762 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:46,762 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:46,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 12:04:46,762 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash -273247555, now seen corresponding path program 1 times [2022-03-20 12:04:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024128943] [2022-03-20 12:04:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024128943] [2022-03-20 12:04:46,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024128943] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:46,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:46,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:04:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65508041] [2022-03-20 12:04:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:46,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:04:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:04:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:46,940 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:47,222 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-03-20 12:04:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 12:04:47,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-03-20 12:04:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:47,223 INFO L225 Difference]: With dead ends: 119 [2022-03-20 12:04:47,223 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 12:04:47,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-03-20 12:04:47,224 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:47,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 199 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:04:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 12:04:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 12:04:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 12:04:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-03-20 12:04:47,229 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-03-20 12:04:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:47,229 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-03-20 12:04:47,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-03-20 12:04:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 12:04:47,230 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:47,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:47,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 12:04:47,230 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 366370572, now seen corresponding path program 1 times [2022-03-20 12:04:47,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:47,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768211447] [2022-03-20 12:04:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:47,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768211447] [2022-03-20 12:04:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768211447] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:47,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:47,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:04:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002656410] [2022-03-20 12:04:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:47,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:04:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:04:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:47,364 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:47,494 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2022-03-20 12:04:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:04:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-03-20 12:04:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:47,495 INFO L225 Difference]: With dead ends: 137 [2022-03-20 12:04:47,495 INFO L226 Difference]: Without dead ends: 93 [2022-03-20 12:04:47,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:47,496 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 85 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:47,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 306 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-20 12:04:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-03-20 12:04:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 12:04:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-03-20 12:04:47,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-03-20 12:04:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:47,501 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-03-20 12:04:47,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-03-20 12:04:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 12:04:47,502 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:47,502 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:47,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 12:04:47,502 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -350640073, now seen corresponding path program 1 times [2022-03-20 12:04:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:47,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247950241] [2022-03-20 12:04:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247950241] [2022-03-20 12:04:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247950241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:47,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:47,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:04:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085438632] [2022-03-20 12:04:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:47,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:04:47,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:04:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:47,621 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:47,744 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-03-20 12:04:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 12:04:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 12:04:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:47,745 INFO L225 Difference]: With dead ends: 92 [2022-03-20 12:04:47,745 INFO L226 Difference]: Without dead ends: 78 [2022-03-20 12:04:47,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:47,745 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 56 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:47,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 205 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-20 12:04:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-20 12:04:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.125) internal successors, (63), 57 states have internal predecessors, (63), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 12:04:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-03-20 12:04:47,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 62 [2022-03-20 12:04:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:47,751 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-03-20 12:04:47,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-03-20 12:04:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 12:04:47,751 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:47,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:47,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 12:04:47,751 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -57237066, now seen corresponding path program 1 times [2022-03-20 12:04:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:47,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466453344] [2022-03-20 12:04:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466453344] [2022-03-20 12:04:47,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466453344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:47,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:47,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:04:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436428484] [2022-03-20 12:04:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:47,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:04:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:04:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:47,887 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:48,014 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-03-20 12:04:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:04:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 12:04:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:48,015 INFO L225 Difference]: With dead ends: 92 [2022-03-20 12:04:48,015 INFO L226 Difference]: Without dead ends: 89 [2022-03-20 12:04:48,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-03-20 12:04:48,016 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:48,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 179 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-20 12:04:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-03-20 12:04:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 59 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 12:04:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-03-20 12:04:48,021 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 62 [2022-03-20 12:04:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:48,021 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-03-20 12:04:48,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-03-20 12:04:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 12:04:48,022 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:48,022 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:48,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 12:04:48,022 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -747542986, now seen corresponding path program 1 times [2022-03-20 12:04:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:48,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752097599] [2022-03-20 12:04:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:48,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752097599] [2022-03-20 12:04:48,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752097599] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:48,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:48,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:04:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845548760] [2022-03-20 12:04:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:48,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:04:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:04:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:48,171 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:48,316 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-03-20 12:04:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:04:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 12:04:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:48,317 INFO L225 Difference]: With dead ends: 87 [2022-03-20 12:04:48,317 INFO L226 Difference]: Without dead ends: 80 [2022-03-20 12:04:48,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:48,320 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:48,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 257 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-20 12:04:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-03-20 12:04:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.103448275862069) internal successors, (64), 59 states have internal predecessors, (64), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 12:04:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-03-20 12:04:48,325 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 62 [2022-03-20 12:04:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:48,325 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-03-20 12:04:48,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-03-20 12:04:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 12:04:48,326 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:48,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:48,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 12:04:48,326 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1805188072, now seen corresponding path program 1 times [2022-03-20 12:04:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:48,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984806045] [2022-03-20 12:04:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984806045] [2022-03-20 12:04:48,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984806045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:48,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:48,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:04:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274075815] [2022-03-20 12:04:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:48,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:04:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:04:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:48,434 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:48,544 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-03-20 12:04:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:04:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 12:04:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:48,545 INFO L225 Difference]: With dead ends: 96 [2022-03-20 12:04:48,545 INFO L226 Difference]: Without dead ends: 76 [2022-03-20 12:04:48,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:48,546 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:48,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 148 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-20 12:04:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-03-20 12:04:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 12:04:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-03-20 12:04:48,551 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-03-20 12:04:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:48,551 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-03-20 12:04:48,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-03-20 12:04:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 12:04:48,551 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:48,551 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:48,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 12:04:48,551 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1247346341, now seen corresponding path program 1 times [2022-03-20 12:04:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:48,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251080355] [2022-03-20 12:04:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:48,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251080355] [2022-03-20 12:04:48,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251080355] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:48,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:48,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:04:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297547367] [2022-03-20 12:04:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:48,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:04:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:04:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:04:48,670 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:48,835 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-03-20 12:04:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 12:04:48,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 12:04:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:48,836 INFO L225 Difference]: With dead ends: 141 [2022-03-20 12:04:48,836 INFO L226 Difference]: Without dead ends: 134 [2022-03-20 12:04:48,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:48,837 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 124 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:48,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 171 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-20 12:04:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-03-20 12:04:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 12:04:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-03-20 12:04:48,875 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-03-20 12:04:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:48,876 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-03-20 12:04:48,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:04:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-03-20 12:04:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 12:04:48,876 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:48,876 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:48,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 12:04:48,877 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash -359842660, now seen corresponding path program 1 times [2022-03-20 12:04:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:48,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484786859] [2022-03-20 12:04:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484786859] [2022-03-20 12:04:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484786859] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:04:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540842508] [2022-03-20 12:04:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:49,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:04:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:04:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:04:49,029 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:49,171 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-03-20 12:04:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:04:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-03-20 12:04:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:49,172 INFO L225 Difference]: With dead ends: 144 [2022-03-20 12:04:49,172 INFO L226 Difference]: Without dead ends: 133 [2022-03-20 12:04:49,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:49,173 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 77 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:49,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 245 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-20 12:04:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-03-20 12:04:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 12:04:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-03-20 12:04:49,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-03-20 12:04:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:49,181 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-03-20 12:04:49,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 12:04:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-03-20 12:04:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-20 12:04:49,181 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:49,181 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:49,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 12:04:49,181 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 544985405, now seen corresponding path program 1 times [2022-03-20 12:04:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:49,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63167946] [2022-03-20 12:04:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 12:04:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:04:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:04:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 12:04:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 12:04:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:49,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63167946] [2022-03-20 12:04:49,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63167946] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:49,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:49,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 12:04:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426678027] [2022-03-20 12:04:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:49,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 12:04:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 12:04:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:04:49,326 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 12:04:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:49,440 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-03-20 12:04:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:04:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-03-20 12:04:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:49,441 INFO L225 Difference]: With dead ends: 133 [2022-03-20 12:04:49,441 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 12:04:49,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-03-20 12:04:49,441 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:49,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:04:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 12:04:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 12:04:49,442 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) [2022-03-20 12:04:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 12:04:49,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-03-20 12:04:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:49,442 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 12:04:49,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 12:04:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 12:04:49,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 12:04:49,444 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 12:04:49,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 12:04:49,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 12:04:51,766 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~SKIP1~0 3)) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 12:04:51,766 INFO L882 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 515 522) no Hoare annotation was computed. [2022-03-20 12:04:51,767 INFO L882 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 515 522) no Hoare annotation was computed. [2022-03-20 12:04:51,767 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~SKIP1~0 3)) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 12:04:51,767 INFO L878 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~SKIP1~0 3)) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 565 575) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 565 575) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 37 50) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 37 50) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 51 72) no Hoare annotation was computed. [2022-03-20 12:04:51,768 INFO L882 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 51 72) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,769 INFO L878 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point L321-1(lines 297 421) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L878 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,769 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,769 INFO L882 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-03-20 12:04:51,769 INFO L878 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,770 INFO L882 garLoopResultBuilder]: For program point L337(lines 323 368) no Hoare annotation was computed. [2022-03-20 12:04:51,770 INFO L882 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-03-20 12:04:51,770 INFO L882 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-03-20 12:04:51,770 INFO L878 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,770 INFO L882 garLoopResultBuilder]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 288 422) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L882 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L882 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 288 422) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L882 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-03-20 12:04:51,771 INFO L878 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,771 INFO L878 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,773 INFO L882 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-03-20 12:04:51,774 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~SKIP1~0 3)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L359(line 359) no Hoare annotation was computed. [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-03-20 12:04:51,775 INFO L878 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-03-20 12:04:51,775 INFO L882 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse2 (= ~compRegistered~0 0)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not .cse2) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (not (= ~NP~0 1)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse2 .cse4))) [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L445-1(lines 445 448) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L878 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse1 .cse3))) [2022-03-20 12:04:51,776 INFO L878 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse0 (not .cse1) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse2 (= ~MPR1~0 ~s~0) .cse1 .cse3))) [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L882 garLoopResultBuilder]: For program point L446-1(line 446) no Hoare annotation was computed. [2022-03-20 12:04:51,776 INFO L878 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse4 (not (= ~pended~0 0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0))) (or (and (<= IofCallDriver_~returnVal2~0 0) .cse0) (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 (and (= ~setEventCalled~0 1) (= 259 IofCallDriver_~returnVal2~0) .cse0) .cse3 .cse4)) (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse1 (not .cse3) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-03-20 12:04:51,776 INFO L878 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse0 (not .cse1) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse2 (= ~MPR1~0 ~s~0) .cse1 .cse3))) [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (= ~compRegistered~0 0)) (.cse1 (not (<= 5 ~MPR1~0))) (.cse3 (not (= ~pended~0 0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse2 .cse3) (or (= ~SKIP1~0 ~NP~0) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse0 (not .cse2) .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse2 .cse1 .cse3))) [2022-03-20 12:04:51,777 INFO L882 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-03-20 12:04:51,777 INFO L882 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-03-20 12:04:51,777 INFO L882 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse1 .cse3))) [2022-03-20 12:04:51,777 INFO L882 garLoopResultBuilder]: For program point L431-1(lines 423 436) no Hoare annotation was computed. [2022-03-20 12:04:51,777 INFO L882 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 423 436) no Hoare annotation was computed. [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 12:04:51,777 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 12:04:51,778 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-20 12:04:51,779 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-20 12:04:51,779 INFO L882 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-03-20 12:04:51,779 INFO L882 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-03-20 12:04:51,779 INFO L878 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (<= 5 ~MPR1~0)) (= ~s~0 ~NP~0) (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0)) (not (= ~MPR3~0 |old(~s~0)|))) [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (<= 5 ~MPR1~0)) (= ~s~0 ~NP~0) (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0)) (not (= ~MPR3~0 |old(~s~0)|))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 523 564) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 523 564) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (or (not (= ~NP~0 1)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~SKIP1~0 3)) (not (<= 5 ~MPR1~0)) (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0)) (not (= ~MPR3~0 |old(~s~0)|))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (<= 5 ~MPR1~0)) (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0)) (not (= ~MPR3~0 |old(~s~0)|))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (<= 5 ~MPR1~0)) (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0)) (not (= ~MPR3~0 |old(~s~0)|))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L509-1(lines 501 514) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 501 514) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 12:04:51,780 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-20 12:04:51,780 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,780 INFO L882 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-03-20 12:04:51,781 INFO L878 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,781 INFO L882 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 (<= (+ ~myStatus~0 1073741637) 0) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L878 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-03-20 12:04:51,782 INFO L882 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L885 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 75 287) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~setEventCalled~0 1) (< 258 KbFilter_PnP_~__cil_tmp23~0) (not (= ~compRegistered~0 0)) (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) .cse4 .cse5) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 (<= (+ ~myStatus~0 1073741637) 0) .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 75 287) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L194-1(lines 194 196) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L878 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-03-20 12:04:51,783 INFO L882 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-03-20 12:04:51,784 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-03-20 12:04:51,787 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 12:04:51,789 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 12:04:51,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:04:51 BasicIcfg [2022-03-20 12:04:51,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 12:04:51,821 INFO L158 Benchmark]: Toolchain (without parser) took 10968.45ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 161.7MB in the beginning and 148.9MB in the end (delta: 12.7MB). Peak memory consumption was 149.4MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,821 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 12:04:51,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.67ms. Allocated memory is still 210.8MB. Free memory was 161.3MB in the beginning and 184.5MB in the end (delta: -23.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,821 INFO L158 Benchmark]: Boogie Preprocessor took 50.47ms. Allocated memory is still 210.8MB. Free memory was 184.5MB in the beginning and 182.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,821 INFO L158 Benchmark]: RCFGBuilder took 466.97ms. Allocated memory is still 210.8MB. Free memory was 182.1MB in the beginning and 159.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,821 INFO L158 Benchmark]: IcfgTransformer took 24.84ms. Allocated memory is still 210.8MB. Free memory was 159.5MB in the beginning and 156.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,822 INFO L158 Benchmark]: TraceAbstraction took 10163.35ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 156.3MB in the beginning and 148.9MB in the end (delta: 7.4MB). Peak memory consumption was 145.2MB. Max. memory is 8.0GB. [2022-03-20 12:04:51,823 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.09ms. Allocated memory is still 210.8MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.67ms. Allocated memory is still 210.8MB. Free memory was 161.3MB in the beginning and 184.5MB in the end (delta: -23.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.47ms. Allocated memory is still 210.8MB. Free memory was 184.5MB in the beginning and 182.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 466.97ms. Allocated memory is still 210.8MB. Free memory was 182.1MB in the beginning and 159.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * IcfgTransformer took 24.84ms. Allocated memory is still 210.8MB. Free memory was 159.5MB in the beginning and 156.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10163.35ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 156.3MB in the beginning and 148.9MB in the end (delta: 7.4MB). Peak memory consumption was 145.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3504 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3496 mSDsluCounter, 4776 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2611 mSDsCounter, 1004 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4773 IncrementalHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1004 mSolverCounterUnsat, 2165 mSDtfsCounter, 4773 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 147 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 343 NumberOfFragments, 2134 HoareAnnotationTreeSize, 283 FomulaSimplifications, 178 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 3929 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 4122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((((5 <= MPR1 && !(SKIP1 == NP)) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= 0 && MPR1 == s) || !(NP == 1)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || ((setEventCalled == 1 && 259 == returnVal2) && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(5 <= MPR1)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(5 <= MPR1)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((((5 <= MPR1 && !(SKIP1 == NP)) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((((5 <= MPR1 && !(SKIP1 == NP)) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((((5 <= MPR1 && !(SKIP1 == NP)) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(5 <= MPR1)) || !(SKIP1 == \old(s))) || !(pended == 0)) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(5 <= MPR1)) || !(SKIP1 == \old(s))) || !(pended == 0)) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) RESULT: Ultimate proved your program to be correct! [2022-03-20 12:04:51,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...