/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_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 12:04:54,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 12:04:54,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 12:04:55,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 12:04:55,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 12:04:55,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 12:04:55,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 12:04:55,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 12:04:55,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 12:04:55,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 12:04:55,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 12:04:55,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 12:04:55,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 12:04:55,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 12:04:55,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 12:04:55,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 12:04:55,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 12:04:55,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 12:04:55,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 12:04:55,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 12:04:55,034 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 12:04:55,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 12:04:55,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 12:04:55,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 12:04:55,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 12:04:55,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 12:04:55,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 12:04:55,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 12:04:55,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 12:04:55,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 12:04:55,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 12:04:55,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 12:04:55,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 12:04:55,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 12:04:55,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 12:04:55,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 12:04:55,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 12:04:55,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 12:04:55,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 12:04:55,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 12:04:55,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 12:04:55,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 12:04:55,049 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:55,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 12:04:55,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 12:04:55,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 12:04:55,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 12:04:55,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 12:04:55,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 12:04:55,074 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 12:04:55,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 12:04:55,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 12:04:55,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 12:04:55,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 12:04:55,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 12:04:55,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 12:04:55,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 12:04:55,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 12:04:55,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 12:04:55,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 12:04:55,078 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 12:04:55,078 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:55,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 12:04:55,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 12:04:55,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 12:04:55,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 12:04:55,306 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 12:04:55,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-03-20 12:04:55,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3b0dca4/1f953a910fcb4489818619398d569baf/FLAG18611d7fe [2022-03-20 12:04:55,757 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 12:04:55,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-03-20 12:04:55,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3b0dca4/1f953a910fcb4489818619398d569baf/FLAG18611d7fe [2022-03-20 12:04:56,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3b0dca4/1f953a910fcb4489818619398d569baf [2022-03-20 12:04:56,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 12:04:56,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 12:04:56,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 12:04:56,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 12:04:56,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 12:04:56,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:04:56" (1/1) ... [2022-03-20 12:04:56,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526e61e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:56, skipping insertion in model container [2022-03-20 12:04:56,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:04:56" (1/1) ... [2022-03-20 12:04:56,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 12:04:56,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 12:04:56,450 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_simpl2.cil-1.c[29620,29633] [2022-03-20 12:04:56,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 12:04:56,460 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 12:04:56,559 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_simpl2.cil-1.c[29620,29633] [2022-03-20 12:04:56,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 12:04:56,572 INFO L208 MainTranslator]: Completed translation [2022-03-20 12:04:56,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:56 WrapperNode [2022-03-20 12:04:56,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 12:04:56,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 12:04:56,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 12:04:56,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 12:04:56,584 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:56" (1/1) ... [2022-03-20 12:04:56,584 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:56" (1/1) ... [2022-03-20 12:04:56,595 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:56" (1/1) ... [2022-03-20 12:04:56,595 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:56" (1/1) ... [2022-03-20 12:04:56,609 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:56" (1/1) ... [2022-03-20 12:04:56,617 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:56" (1/1) ... [2022-03-20 12:04:56,620 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:56" (1/1) ... [2022-03-20 12:04:56,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 12:04:56,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 12:04:56,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 12:04:56,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 12:04:56,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:56" (1/1) ... [2022-03-20 12:04:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 12:04:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 12:04:56,685 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:56,717 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:56,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 12:04:56,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 12:04:56,744 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 12:04:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 12:04:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 12:04:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-20 12:04:56,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 12:04:56,746 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 12:04:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 12:04:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 12:04:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 12:04:56,747 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-03-20 12:04:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 12:04:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 12:04:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 12:04:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 12:04:56,911 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 12:04:56,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 12:04:56,987 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-03-20 12:04:57,057 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-03-20 12:04:57,062 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,127 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 12:04:57,127 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 12:04:57,197 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 12:04:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 12:04:57,213 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,306 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-20 12:04:57,307 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-20 12:04:57,310 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,335 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-03-20 12:04:57,335 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-03-20 12:04:57,340 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 12:04:57,364 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 12:04:57,364 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 12:04:57,397 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 12:04:57,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 12:04:57,404 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-20 12:04:57,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:57 BoogieIcfgContainer [2022-03-20 12:04:57,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 12:04:57,410 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 12:04:57,410 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 12:04:57,411 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 12:04:57,414 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:57" (1/1) ... [2022-03-20 12:04:57,415 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 12:04:57,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 12:04:57 BasicIcfg [2022-03-20 12:04:57,455 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 12:04:57,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 12:04:57,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 12:04:57,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 12:04:57,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 12:04:56" (1/4) ... [2022-03-20 12:04:57,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c09e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:04:57, skipping insertion in model container [2022-03-20 12:04:57,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:04:56" (2/4) ... [2022-03-20 12:04:57,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c09e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:04:57, skipping insertion in model container [2022-03-20 12:04:57,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:04:57" (3/4) ... [2022-03-20 12:04:57,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c09e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:04:57, skipping insertion in model container [2022-03-20 12:04:57,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 12:04:57" (4/4) ... [2022-03-20 12:04:57,467 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.cqvasr [2022-03-20 12:04:57,472 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 12:04:57,472 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 12:04:57,506 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 12:04:57,511 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:57,511 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 12:04:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-03-20 12:04:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 12:04:57,534 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:57,535 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:57,535 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 685042341, now seen corresponding path program 1 times [2022-03-20 12:04:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541954257] [2022-03-20 12:04:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:57,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:57,952 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:57,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541954257] [2022-03-20 12:04:57,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541954257] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:57,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:57,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 12:04:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103350954] [2022-03-20 12:04:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:57,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 12:04:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 12:04:57,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 12:04:57,989 INFO L87 Difference]: Start difference. First operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:58,805 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-03-20 12:04:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 12:04:58,807 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:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:58,821 INFO L225 Difference]: With dead ends: 415 [2022-03-20 12:04:58,821 INFO L226 Difference]: Without dead ends: 256 [2022-03-20 12:04:58,828 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:58,831 INFO L913 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:58,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 12:04:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-20 12:04:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-03-20 12:04:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-20 12:04:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-03-20 12:04:58,898 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-03-20 12:04:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:58,899 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-03-20 12:04:58,899 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:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-03-20 12:04:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 12:04:58,900 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:58,900 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] [2022-03-20 12:04:58,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 12:04:58,900 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1276904425, now seen corresponding path program 1 times [2022-03-20 12:04:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:58,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539933828] [2022-03-20 12:04:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:04:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:59,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:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:04:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539933828] [2022-03-20 12:04:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539933828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:04:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:04:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:04:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642353899] [2022-03-20 12:04:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:04:59,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:04:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:04:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:04:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:04:59,032 INFO L87 Difference]: Start difference. First operand 228 states and 322 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:04:59,867 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-03-20 12:04:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 12:04:59,868 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-03-20 12:04:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:04:59,870 INFO L225 Difference]: With dead ends: 401 [2022-03-20 12:04:59,871 INFO L226 Difference]: Without dead ends: 343 [2022-03-20 12:04:59,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:04:59,872 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 380 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 12:04:59,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 490 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 12:04:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-03-20 12:04:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-03-20 12:04:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-03-20 12:04:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-03-20 12:04:59,896 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-03-20 12:04:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:04:59,897 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-03-20 12:04:59,897 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:04:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-03-20 12:04:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 12:04:59,898 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:04:59,898 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] [2022-03-20 12:04:59,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 12:04:59,898 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:04:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:04:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 42368072, now seen corresponding path program 1 times [2022-03-20 12:04:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:04:59,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181236346] [2022-03-20 12:04:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:04:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:04:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:04:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:04:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:04:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,021 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:05:00,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181236346] [2022-03-20 12:05:00,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181236346] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:00,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:00,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:05:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753860884] [2022-03-20 12:05:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:00,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:05:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:05:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:05:00,023 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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:05:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:00,545 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-03-20 12:05:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 12:05:00,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2022-03-20 12:05:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:00,550 INFO L225 Difference]: With dead ends: 478 [2022-03-20 12:05:00,551 INFO L226 Difference]: Without dead ends: 362 [2022-03-20 12:05:00,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:05:00,556 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 404 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:00,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 379 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 12:05:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-03-20 12:05:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-03-20 12:05:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-03-20 12:05:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-03-20 12:05:00,596 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-03-20 12:05:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:00,596 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-03-20 12:05:00,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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:05:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-03-20 12:05:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-20 12:05:00,604 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:00,604 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] [2022-03-20 12:05:00,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 12:05:00,605 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1039161410, now seen corresponding path program 1 times [2022-03-20 12:05:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846499186] [2022-03-20 12:05:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:00,809 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:05:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846499186] [2022-03-20 12:05:00,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846499186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:00,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:00,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 12:05:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292612611] [2022-03-20 12:05:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:00,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 12:05:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 12:05:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 12:05:00,814 INFO L87 Difference]: Start difference. First operand 341 states and 462 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:05:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:01,265 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-03-20 12:05:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 12:05:01,266 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-03-20 12:05:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:01,268 INFO L225 Difference]: With dead ends: 344 [2022-03-20 12:05:01,268 INFO L226 Difference]: Without dead ends: 340 [2022-03-20 12:05:01,269 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:05:01,270 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 343 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:01,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 385 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 12:05:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-03-20 12:05:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-03-20 12:05:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-03-20 12:05:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-03-20 12:05:01,294 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-03-20 12:05:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:01,294 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-03-20 12:05:01,295 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 12:05:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-03-20 12:05:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 12:05:01,296 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:01,297 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] [2022-03-20 12:05:01,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 12:05:01,297 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 827623692, now seen corresponding path program 1 times [2022-03-20 12:05:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:01,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551290934] [2022-03-20 12:05:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:01,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:01,450 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:05:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:01,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551290934] [2022-03-20 12:05:01,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551290934] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:01,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 12:05:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203504883] [2022-03-20 12:05:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:01,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 12:05:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 12:05:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:05:01,452 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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:05:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:02,096 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-03-20 12:05:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 12:05:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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 46 [2022-03-20 12:05:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:02,099 INFO L225 Difference]: With dead ends: 385 [2022-03-20 12:05:02,100 INFO L226 Difference]: Without dead ends: 319 [2022-03-20 12:05:02,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:02,101 INFO L913 BasicCegarLoop]: 298 mSDtfsCounter, 595 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:02,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 542 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 12:05:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-03-20 12:05:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-03-20 12:05:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-03-20 12:05:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-03-20 12:05:02,125 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-03-20 12:05:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:02,126 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-03-20 12:05:02,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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:05:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-03-20 12:05:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 12:05:02,127 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:02,128 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:05:02,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 12:05:02,128 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1073883700, now seen corresponding path program 1 times [2022-03-20 12:05:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:02,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721133409] [2022-03-20 12:05:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 12:05:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 12:05:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:02,396 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:05:02,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:02,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721133409] [2022-03-20 12:05:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721133409] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:02,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:02,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052891381] [2022-03-20 12:05:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:02,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:02,398 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:05:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:03,352 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-03-20 12:05:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 12:05:03,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-03-20 12:05:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:03,355 INFO L225 Difference]: With dead ends: 327 [2022-03-20 12:05:03,355 INFO L226 Difference]: Without dead ends: 322 [2022-03-20 12:05:03,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-03-20 12:05:03,356 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 1068 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:03,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 465 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 12:05:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-20 12:05:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-03-20 12:05:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-03-20 12:05:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-03-20 12:05:03,377 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-03-20 12:05:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:03,378 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-03-20 12:05:03,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:05:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-03-20 12:05:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 12:05:03,379 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:03,379 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] [2022-03-20 12:05:03,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 12:05:03,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1039481029, now seen corresponding path program 1 times [2022-03-20 12:05:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776897207] [2022-03-20 12:05:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 12:05:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 12:05:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:03,638 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:05:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:03,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776897207] [2022-03-20 12:05:03,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776897207] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:03,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:03,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259474001] [2022-03-20 12:05:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:03,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:03,640 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:05:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:04,354 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-03-20 12:05:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 12:05:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-03-20 12:05:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:04,356 INFO L225 Difference]: With dead ends: 327 [2022-03-20 12:05:04,356 INFO L226 Difference]: Without dead ends: 322 [2022-03-20 12:05:04,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-03-20 12:05:04,357 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 919 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:04,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [921 Valid, 415 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 12:05:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-20 12:05:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-03-20 12:05:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-03-20 12:05:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-03-20 12:05:04,384 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-03-20 12:05:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:04,384 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-03-20 12:05:04,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 12:05:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-03-20 12:05:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 12:05:04,385 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:04,385 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] [2022-03-20 12:05:04,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 12:05:04,386 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2137589877, now seen corresponding path program 1 times [2022-03-20 12:05:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:04,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889865171] [2022-03-20 12:05:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:04,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 12:05:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 12:05:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,546 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:05:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:04,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889865171] [2022-03-20 12:05:04,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889865171] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:04,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:04,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 12:05:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573927669] [2022-03-20 12:05:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:04,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 12:05:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 12:05:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:05:04,550 INFO L87 Difference]: Start difference. First operand 316 states and 419 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 12:05:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:04,859 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-03-20 12:05:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:04,860 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-03-20 12:05:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:04,861 INFO L225 Difference]: With dead ends: 330 [2022-03-20 12:05:04,861 INFO L226 Difference]: Without dead ends: 102 [2022-03-20 12:05:04,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:04,862 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 723 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:04,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 332 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:05:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-03-20 12:05:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-03-20 12:05:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 12:05:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-03-20 12:05:04,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-03-20 12:05:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:04,870 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-03-20 12:05:04,870 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 12:05:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-03-20 12:05:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 12:05:04,871 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:04,871 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] [2022-03-20 12:05:04,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 12:05:04,872 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1910683918, now seen corresponding path program 1 times [2022-03-20 12:05:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:04,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130564785] [2022-03-20 12:05:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 12:05:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 12:05:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,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:05:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:05,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130564785] [2022-03-20 12:05:05,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130564785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:05,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:05,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 12:05:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065536092] [2022-03-20 12:05:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:05,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 12:05:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:05,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 12:05:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:05:05,029 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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:05:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:05,226 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-03-20 12:05:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2022-03-20 12:05:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:05,228 INFO L225 Difference]: With dead ends: 130 [2022-03-20 12:05:05,228 INFO L226 Difference]: Without dead ends: 100 [2022-03-20 12:05:05,228 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:05:05,229 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:05,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 209 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-20 12:05:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-03-20 12:05:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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:05:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-03-20 12:05:05,237 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-03-20 12:05:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:05,237 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-03-20 12:05:05,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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:05:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-03-20 12:05:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 12:05:05,238 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:05,238 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] [2022-03-20 12:05:05,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 12:05:05,239 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:05,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash -948674633, now seen corresponding path program 1 times [2022-03-20 12:05:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:05,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547550800] [2022-03-20 12:05:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,395 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:05:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:05,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547550800] [2022-03-20 12:05:05,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547550800] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:05,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:05,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 12:05:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239904139] [2022-03-20 12:05:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:05,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 12:05:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 12:05:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:05:05,397 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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:05:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:05,605 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-03-20 12:05:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 12:05:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-03-20 12:05:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:05,606 INFO L225 Difference]: With dead ends: 152 [2022-03-20 12:05:05,607 INFO L226 Difference]: Without dead ends: 111 [2022-03-20 12:05:05,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:05,607 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:05,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 322 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:05:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-20 12:05:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-03-20 12:05:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-03-20 12:05:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-03-20 12:05:05,616 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-03-20 12:05:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:05,617 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-03-20 12:05:05,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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:05:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-03-20 12:05:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 12:05:05,617 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:05,617 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] [2022-03-20 12:05:05,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 12:05:05,618 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1641862871, now seen corresponding path program 1 times [2022-03-20 12:05:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:05,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734200663] [2022-03-20 12:05:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:05,776 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:05:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734200663] [2022-03-20 12:05:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734200663] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:05,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:05,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 12:05:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067175699] [2022-03-20 12:05:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:05,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 12:05:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:05,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 12:05:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:05:05,777 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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:05:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:05,988 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-03-20 12:05:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:05:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-03-20 12:05:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:05,989 INFO L225 Difference]: With dead ends: 116 [2022-03-20 12:05:05,989 INFO L226 Difference]: Without dead ends: 109 [2022-03-20 12:05:05,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-03-20 12:05:05,990 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:05,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 305 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-20 12:05:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-03-20 12:05:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-03-20 12:05:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-03-20 12:05:05,998 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-03-20 12:05:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:05,998 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-03-20 12:05:05,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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:05:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-03-20 12:05:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 12:05:05,999 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:05,999 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] [2022-03-20 12:05:05,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 12:05:05,999 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1083966817, now seen corresponding path program 1 times [2022-03-20 12:05:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914340367] [2022-03-20 12:05:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,115 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:05:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:06,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914340367] [2022-03-20 12:05:06,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914340367] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:06,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:06,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 12:05:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304058492] [2022-03-20 12:05:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:06,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 12:05:06,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 12:05:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-20 12:05:06,116 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 12:05:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:06,324 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2022-03-20 12:05:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 12:05:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-03-20 12:05:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:06,326 INFO L225 Difference]: With dead ends: 203 [2022-03-20 12:05:06,326 INFO L226 Difference]: Without dead ends: 196 [2022-03-20 12:05:06,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:05:06,327 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:06,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 188 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:05:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-20 12:05:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2022-03-20 12:05:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 144 states have (on average 1.1875) internal successors, (171), 146 states have internal predecessors, (171), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (18), 17 states have call predecessors, (18), 14 states have call successors, (18) [2022-03-20 12:05:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2022-03-20 12:05:06,340 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 58 [2022-03-20 12:05:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:06,340 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2022-03-20 12:05:06,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 12:05:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2022-03-20 12:05:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 12:05:06,341 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:06,341 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] [2022-03-20 12:05:06,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 12:05:06,342 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1971470498, now seen corresponding path program 1 times [2022-03-20 12:05:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345365721] [2022-03-20 12:05:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,485 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:05:06,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:06,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345365721] [2022-03-20 12:05:06,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345365721] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:06,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:06,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 12:05:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627560916] [2022-03-20 12:05:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:06,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 12:05:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:06,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 12:05:06,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 12:05:06,486 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 12:05:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:06,591 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2022-03-20 12:05:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-03-20 12:05:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:06,592 INFO L225 Difference]: With dead ends: 248 [2022-03-20 12:05:06,592 INFO L226 Difference]: Without dead ends: 172 [2022-03-20 12:05:06,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 12:05:06,593 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 88 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:06,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 256 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-20 12:05:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-03-20 12:05:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 134 states have internal predecessors, (153), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (18), 17 states have call predecessors, (18), 14 states have call successors, (18) [2022-03-20 12:05:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2022-03-20 12:05:06,606 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 58 [2022-03-20 12:05:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:06,606 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2022-03-20 12:05:06,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 12:05:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2022-03-20 12:05:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 12:05:06,607 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:06,607 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:05:06,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 12:05:06,607 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2034770721, now seen corresponding path program 1 times [2022-03-20 12:05:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:06,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649710181] [2022-03-20 12:05:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:06,831 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:05:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649710181] [2022-03-20 12:05:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649710181] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968447846] [2022-03-20 12:05:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:06,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:06,833 INFO L87 Difference]: Start difference. First operand 172 states and 192 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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:05:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:07,109 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-03-20 12:05:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 12:05:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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 62 [2022-03-20 12:05:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:07,111 INFO L225 Difference]: With dead ends: 220 [2022-03-20 12:05:07,111 INFO L226 Difference]: Without dead ends: 156 [2022-03-20 12:05:07,111 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:05:07,111 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:07,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 204 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-03-20 12:05:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-03-20 12:05:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 118 states have (on average 1.1440677966101696) internal successors, (135), 120 states have internal predecessors, (135), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-03-20 12:05:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-03-20 12:05:07,121 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 62 [2022-03-20 12:05:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:07,121 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-03-20 12:05:07,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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:05:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-03-20 12:05:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 12:05:07,121 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:07,121 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] [2022-03-20 12:05:07,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 12:05:07,122 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:07,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1057027574, now seen corresponding path program 1 times [2022-03-20 12:05:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:07,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699644911] [2022-03-20 12:05:07,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:07,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,254 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:05:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699644911] [2022-03-20 12:05:07,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699644911] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:07,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:07,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:05:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917570808] [2022-03-20 12:05:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:07,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:05:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:05:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:05:07,256 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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:05:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:07,405 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2022-03-20 12:05:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 12:05:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-03-20 12:05:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:07,407 INFO L225 Difference]: With dead ends: 216 [2022-03-20 12:05:07,407 INFO L226 Difference]: Without dead ends: 168 [2022-03-20 12:05:07,407 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:05:07,407 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:07,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 181 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-03-20 12:05:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-03-20 12:05:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 126 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-03-20 12:05:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-03-20 12:05:07,417 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 64 [2022-03-20 12:05:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:07,417 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-03-20 12:05:07,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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:05:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-03-20 12:05:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 12:05:07,418 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:07,418 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] [2022-03-20 12:05:07,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 12:05:07,418 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 763624567, now seen corresponding path program 1 times [2022-03-20 12:05:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:07,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754032621] [2022-03-20 12:05:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,529 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:05:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:07,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754032621] [2022-03-20 12:05:07,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754032621] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:07,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:07,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:05:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392309318] [2022-03-20 12:05:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:07,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:05:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:05:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:05:07,532 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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:05:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:07,656 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-03-20 12:05:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:07,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-03-20 12:05:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:07,658 INFO L225 Difference]: With dead ends: 182 [2022-03-20 12:05:07,658 INFO L226 Difference]: Without dead ends: 177 [2022-03-20 12:05:07,658 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:05:07,659 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:07,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-20 12:05:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2022-03-20 12:05:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.125) internal successors, (144), 130 states have internal predecessors, (144), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-03-20 12:05:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-03-20 12:05:07,670 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 64 [2022-03-20 12:05:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:07,671 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-03-20 12:05:07,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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:05:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-03-20 12:05:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 12:05:07,672 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:07,672 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] [2022-03-20 12:05:07,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 12:05:07,672 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1206614856, now seen corresponding path program 1 times [2022-03-20 12:05:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667536950] [2022-03-20 12:05:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:07,822 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:05:07,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:07,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667536950] [2022-03-20 12:05:07,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667536950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:07,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:07,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156503452] [2022-03-20 12:05:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:07,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:07,824 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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:05:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:07,977 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2022-03-20 12:05:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:05:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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 64 [2022-03-20 12:05:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:07,979 INFO L225 Difference]: With dead ends: 182 [2022-03-20 12:05:07,979 INFO L226 Difference]: Without dead ends: 175 [2022-03-20 12:05:07,979 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:05:07,979 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 111 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:07,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 323 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-03-20 12:05:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2022-03-20 12:05:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.109375) internal successors, (142), 130 states have internal predecessors, (142), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-03-20 12:05:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-03-20 12:05:07,999 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 64 [2022-03-20 12:05:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:08,001 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-03-20 12:05:08,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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:05:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-03-20 12:05:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 12:05:08,002 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:08,002 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] [2022-03-20 12:05:08,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 12:05:08,003 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2128246060, now seen corresponding path program 1 times [2022-03-20 12:05:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:08,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346130375] [2022-03-20 12:05:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,180 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:05:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:08,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346130375] [2022-03-20 12:05:08,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346130375] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:08,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:08,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:08,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500111828] [2022-03-20 12:05:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:08,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:08,181 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:05:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:08,540 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-03-20 12:05:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 12:05:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-03-20 12:05:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:08,542 INFO L225 Difference]: With dead ends: 169 [2022-03-20 12:05:08,542 INFO L226 Difference]: Without dead ends: 144 [2022-03-20 12:05:08,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-20 12:05:08,543 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:08,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 171 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 12:05:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-20 12:05:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-03-20 12:05:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.091743119266055) internal successors, (119), 110 states have internal predecessors, (119), 20 states have call successors, (20), 19 states have call predecessors, (20), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 12:05:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-03-20 12:05:08,554 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 65 [2022-03-20 12:05:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:08,554 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-03-20 12:05:08,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 12:05:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-03-20 12:05:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 12:05:08,556 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:08,556 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] [2022-03-20 12:05:08,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 12:05:08,556 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1266450091, now seen corresponding path program 1 times [2022-03-20 12:05:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:08,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699108715] [2022-03-20 12:05:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,704 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:05:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:08,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699108715] [2022-03-20 12:05:08,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699108715] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:08,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:08,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 12:05:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825886387] [2022-03-20 12:05:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:08,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 12:05:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 12:05:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 12:05:08,706 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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:05:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:08,842 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-03-20 12:05:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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 65 [2022-03-20 12:05:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:08,843 INFO L225 Difference]: With dead ends: 169 [2022-03-20 12:05:08,843 INFO L226 Difference]: Without dead ends: 137 [2022-03-20 12:05:08,844 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:05:08,844 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 72 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:08,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 154 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-20 12:05:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-03-20 12:05:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 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:05:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2022-03-20 12:05:08,854 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 65 [2022-03-20 12:05:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:08,854 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2022-03-20 12:05:08,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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:05:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-03-20 12:05:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-20 12:05:08,854 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:08,854 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] [2022-03-20 12:05:08,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 12:05:08,855 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash 79966819, now seen corresponding path program 1 times [2022-03-20 12:05:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:08,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619782366] [2022-03-20 12:05:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,026 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:05:09,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:09,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619782366] [2022-03-20 12:05:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619782366] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:09,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:09,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 12:05:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491670793] [2022-03-20 12:05:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:09,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 12:05:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 12:05:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 12:05:09,028 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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:05:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:09,177 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2022-03-20 12:05:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 12:05:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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 65 [2022-03-20 12:05:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:09,178 INFO L225 Difference]: With dead ends: 148 [2022-03-20 12:05:09,178 INFO L226 Difference]: Without dead ends: 137 [2022-03-20 12:05:09,179 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:05:09,179 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:09,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 272 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-20 12:05:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-03-20 12:05:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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:05:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-03-20 12:05:09,190 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 65 [2022-03-20 12:05:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:09,190 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-03-20 12:05:09,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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:05:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-03-20 12:05:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 12:05:09,191 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 12:05:09,191 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, 1, 1] [2022-03-20 12:05:09,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 12:05:09,191 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 12:05:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 12:05:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash -117181948, now seen corresponding path program 1 times [2022-03-20 12:05:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 12:05:09,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556770099] [2022-03-20 12:05:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 12:05:09,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 12:05:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 12:05:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 12:05:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 12:05:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 12:05:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 12:05:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 12:05:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 12:05:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-03-20 12:05:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 12:05:09,336 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:05:09,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 12:05:09,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556770099] [2022-03-20 12:05:09,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556770099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 12:05:09,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 12:05:09,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 12:05:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445382280] [2022-03-20 12:05:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 12:05:09,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 12:05:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 12:05:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 12:05:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 12:05:09,338 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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:05:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 12:05:09,474 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-03-20 12:05:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 12:05:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2022-03-20 12:05:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 12:05:09,476 INFO L225 Difference]: With dead ends: 137 [2022-03-20 12:05:09,476 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 12:05:09,476 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:05:09,476 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 12:05:09,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 176 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 12:05:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 12:05:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 12:05:09,478 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:05:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 12:05:09,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-03-20 12:05:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 12:05:09,479 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 12:05:09,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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:05:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 12:05:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 12:05:09,481 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 12:05:09,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 12:05:09,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 12:05:13,729 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-20 12:05:13,730 INFO L882 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 568 575) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 568 575) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-20 12:05:13,731 INFO L878 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 43 56) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 43 56) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L878 garLoopResultBuilder]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,731 INFO L882 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-03-20 12:05:13,731 INFO L878 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L878 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L878 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L878 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point KbFilter_PowerFINAL(lines 689 744) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point KbFilter_PowerEXIT(lines 689 744) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= ~s~0 ~DC~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 57 78) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L882 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 57 78) no Hoare annotation was computed. [2022-03-20 12:05:13,732 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= |old(~Executive~0)| ~Executive~0) (<= ~s~0 ~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)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,733 INFO L878 garLoopResultBuilder]: At program point L328(line 328) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (<= ~s~0 ~DC~0) (= main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L328-1(lines 324 465) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L878 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,733 INFO L878 garLoopResultBuilder]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L878 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L344(lines 330 413) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-03-20 12:05:13,733 INFO L882 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L878 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 295 466) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 295 466) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L878 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L878 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L878 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,734 INFO L882 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-03-20 12:05:13,734 INFO L878 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L878 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L878 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L395(line 395) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L878 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,735 INFO L878 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L400(line 400) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-03-20 12:05:13,735 INFO L882 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-03-20 12:05:13,736 INFO L882 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-03-20 12:05:13,736 INFO L882 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-03-20 12:05:13,736 INFO L882 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-20 12:05:13,736 INFO L882 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .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)|)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0 .cse1) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-20 12:05:13,736 INFO L878 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,736 INFO L882 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L878 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,737 INFO L878 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2022-03-20 12:05:13,737 INFO L878 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1))) [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point PoCallDriverFINAL(lines 745 821) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point PoCallDriverEXIT(lines 745 821) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L878 garLoopResultBuilder]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-03-20 12:05:13,737 INFO L882 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L878 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L878 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,738 INFO L878 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,738 INFO L878 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,738 INFO L878 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-03-20 12:05:13,738 INFO L882 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-03-20 12:05:13,739 INFO L878 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,739 INFO L878 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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:05:13,740 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,740 INFO L882 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-03-20 12:05:13,740 INFO L878 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,741 INFO L882 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-03-20 12:05:13,741 INFO L878 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,741 INFO L882 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L878 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L878 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,742 INFO L878 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,742 INFO L878 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point KbFilter_InternIoCtlFINAL(lines 822 1007) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point KbFilter_InternIoCtlEXIT(lines 822 1007) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-03-20 12:05:13,742 INFO L882 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L878 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse9 (= ~compRegistered~0 1)) (.cse10 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse12 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (not .cse12)) (.cse5 (and .cse9 .cse11 .cse10 (not .cse1) (= ~s~0 ~NP~0) .cse12)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse10)) (.cse8 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))) (or (not (= |old(~s~0)| 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2022-03-20 12:05:13,743 INFO L878 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse9 (= ~compRegistered~0 1)) (.cse10 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse12 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (not .cse12)) (.cse5 (and .cse9 .cse11 .cse10 (not .cse1) (= ~s~0 ~NP~0) .cse12)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse10)) (.cse8 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))) (or (not (= |old(~s~0)| 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 576 617) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 576 617) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or (not (= |old(~s~0)| 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L878 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or (not (= |old(~s~0)| 1)) .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-03-20 12:05:13,743 INFO L882 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-03-20 12:05:13,743 INFO L878 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or (not (= |old(~s~0)| 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-03-20 12:05:13,744 INFO L882 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-03-20 12:05:13,744 INFO L882 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-03-20 12:05:13,744 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,744 INFO L882 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-03-20 12:05:13,744 INFO L878 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1))))) [2022-03-20 12:05:13,744 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 12:05:13,745 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L878 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L878 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,745 INFO L878 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-03-20 12:05:13,745 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,745 INFO L882 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L878 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,746 INFO L882 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L882 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-03-20 12:05:13,747 INFO L878 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,747 INFO L882 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-03-20 12:05:13,747 INFO L882 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-03-20 12:05:13,747 INFO L882 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 81 294) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 81 294) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L878 garLoopResultBuilder]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 1)) (.cse11 (= ~NP~0 1))) (let ((.cse0 (not .cse11)) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (= ~pended~0 1)) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse6 (not (<= 7 ~IPC~0))) (.cse7 (not (<= 4 ~SKIP2~0))) (.cse8 (and .cse1 (= ~s~0 ~NP~0) .cse11 (= ~s~0 |old(~s~0)|))) (.cse9 (not (<= 6 ~MPR3~0))) (.cse10 (not (= 2 ~DC~0)))) (and (or .cse0 (and .cse1 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L201-1(lines 201 203) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L878 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-03-20 12:05:13,748 INFO L882 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-03-20 12:05:13,749 INFO L882 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-03-20 12:05:13,752 INFO L719 BasicCegarLoop]: Path program histogram: [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:05:13,753 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 12:05:13,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:05:13 BasicIcfg [2022-03-20 12:05:13,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 12:05:13,785 INFO L158 Benchmark]: Toolchain (without parser) took 17618.60ms. Allocated memory was 177.2MB in the beginning and 439.4MB in the end (delta: 262.1MB). Free memory was 123.5MB in the beginning and 295.9MB in the end (delta: -172.4MB). Peak memory consumption was 230.7MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,785 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 12:05:13,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.20ms. Allocated memory was 177.2MB in the beginning and 295.7MB in the end (delta: 118.5MB). Free memory was 123.2MB in the beginning and 263.4MB in the end (delta: -140.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,786 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 295.7MB. Free memory was 263.4MB in the beginning and 260.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,786 INFO L158 Benchmark]: RCFGBuilder took 780.19ms. Allocated memory is still 295.7MB. Free memory was 260.8MB in the beginning and 226.2MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,786 INFO L158 Benchmark]: IcfgTransformer took 44.60ms. Allocated memory is still 295.7MB. Free memory was 226.2MB in the beginning and 222.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,786 INFO L158 Benchmark]: TraceAbstraction took 16325.40ms. Allocated memory was 295.7MB in the beginning and 439.4MB in the end (delta: 143.7MB). Free memory was 222.0MB in the beginning and 295.9MB in the end (delta: -73.9MB). Peak memory consumption was 210.8MB. Max. memory is 8.0GB. [2022-03-20 12:05:13,787 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 177.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 393.20ms. Allocated memory was 177.2MB in the beginning and 295.7MB in the end (delta: 118.5MB). Free memory was 123.2MB in the beginning and 263.4MB in the end (delta: -140.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 295.7MB. Free memory was 263.4MB in the beginning and 260.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 780.19ms. Allocated memory is still 295.7MB. Free memory was 260.8MB in the beginning and 226.2MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * IcfgTransformer took 44.60ms. Allocated memory is still 295.7MB. Free memory was 226.2MB in the beginning and 222.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 16325.40ms. Allocated memory was 295.7MB in the beginning and 439.4MB in the end (delta: 143.7MB). Free memory was 222.0MB in the beginning and 295.9MB in the end (delta: -73.9MB). Peak memory consumption was 210.8MB. 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: 1013]: 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 18 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5636 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5619 mSDsluCounter, 6420 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3242 mSDsCounter, 1305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6399 IncrementalHoareTripleChecker+Invalid, 7704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1305 mSolverCounterUnsat, 3178 mSDtfsCounter, 6399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 380 PreInvPairs, 484 NumberOfFragments, 4195 HoareAnnotationTreeSize, 380 FomulaSimplifications, 908 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 84 FomulaSimplificationsInter, 6392 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 5192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(\old(s) == 1) || !(NP == 1)) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || ((((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && status == 0) && compRegistered == 0) && s == \old(s))) || !(2 == DC) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(\old(s) == 1) || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || (((returnVal2 <= 0 && 0 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(\old(s) == 1) || !(NP == 1)) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) && (((((((((!(NP == 1) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || (((((((((6 <= MPR3 && status == 0) && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && s == NP) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) RESULT: Ultimate proved your program to be correct! [2022-03-20 12:05:13,855 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...