/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-05ce600 [2022-02-24 00:31:12,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 00:31:12,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 00:31:13,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 00:31:13,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 00:31:13,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 00:31:13,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 00:31:13,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 00:31:13,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 00:31:13,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 00:31:13,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 00:31:13,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 00:31:13,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 00:31:13,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 00:31:13,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 00:31:13,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 00:31:13,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 00:31:13,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 00:31:13,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 00:31:13,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 00:31:13,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 00:31:13,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 00:31:13,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 00:31:13,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 00:31:13,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 00:31:13,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 00:31:13,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 00:31:13,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 00:31:13,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 00:31:13,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 00:31:13,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 00:31:13,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 00:31:13,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 00:31:13,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 00:31:13,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 00:31:13,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 00:31:13,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 00:31:13,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 00:31:13,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 00:31:13,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 00:31:13,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 00:31:13,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-24 00:31:13,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 00:31:13,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 00:31:13,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-24 00:31:13,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-24 00:31:13,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-24 00:31:13,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-24 00:31:13,125 INFO L138 SettingsManager]: * Use SBE=true [2022-02-24 00:31:13,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 00:31:13,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 00:31:13,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 00:31:13,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 00:31:13,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 00:31:13,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 00:31:13,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 00:31:13,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 00:31:13,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:31:13,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-24 00:31:13,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-24 00:31:13,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-24 00:31:13,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 00:31:13,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-24 00:31:13,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-24 00:31:13,129 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-24 00:31:13,129 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-02-24 00:31:13,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 00:31:13,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 00:31:13,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 00:31:13,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 00:31:13,376 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 00:31:13,377 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-02-24 00:31:13,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f01d5a/1051cc50cf724b299c84bc9333810f5f/FLAG5131a0eb9 [2022-02-24 00:31:13,910 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 00:31:13,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-02-24 00:31:13,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f01d5a/1051cc50cf724b299c84bc9333810f5f/FLAG5131a0eb9 [2022-02-24 00:31:14,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f01d5a/1051cc50cf724b299c84bc9333810f5f [2022-02-24 00:31:14,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 00:31:14,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-24 00:31:14,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 00:31:14,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 00:31:14,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 00:31:14,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e49c63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14, skipping insertion in model container [2022-02-24 00:31:14,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 00:31:14,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 00:31:14,764 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-02-24 00:31:14,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:31:14,780 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 00:31:14,857 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-02-24 00:31:14,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:31:14,873 INFO L208 MainTranslator]: Completed translation [2022-02-24 00:31:14,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14 WrapperNode [2022-02-24 00:31:14,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 00:31:14,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 00:31:14,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 00:31:14,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 00:31:14,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 00:31:14,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 00:31:14,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 00:31:14,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 00:31:14,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (1/1) ... [2022-02-24 00:31:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:31:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:31:15,003 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-02-24 00:31:15,016 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-02-24 00:31:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 00:31:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 00:31:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 00:31:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-24 00:31:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-02-24 00:31:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-02-24 00:31:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-02-24 00:31:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-02-24 00:31:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-02-24 00:31:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-24 00:31:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-02-24 00:31:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-24 00:31:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 00:31:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 00:31:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 00:31:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 00:31:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 00:31:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 00:31:15,178 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 00:31:15,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 00:31:15,253 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,360 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-02-24 00:31:15,360 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-02-24 00:31:15,366 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,406 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-24 00:31:15,407 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-24 00:31:15,533 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,565 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-24 00:31:15,565 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-24 00:31:15,577 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,672 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-02-24 00:31:15,673 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-02-24 00:31:15,676 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,692 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-02-24 00:31:15,693 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-02-24 00:31:15,701 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:31:15,736 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-24 00:31:15,736 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-24 00:31:15,783 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 00:31:15,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 00:31:15,791 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-24 00:31:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:31:15 BoogieIcfgContainer [2022-02-24 00:31:15,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 00:31:15,795 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-24 00:31:15,795 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-24 00:31:15,799 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-24 00:31:15,803 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:31:15" (1/1) ... [2022-02-24 00:31:15,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:31:15 BasicIcfg [2022-02-24 00:31:15,865 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-24 00:31:15,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 00:31:15,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 00:31:15,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 00:31:15,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:31:14" (1/4) ... [2022-02-24 00:31:15,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2fe70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:31:15, skipping insertion in model container [2022-02-24 00:31:15,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:31:14" (2/4) ... [2022-02-24 00:31:15,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2fe70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:31:15, skipping insertion in model container [2022-02-24 00:31:15,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:31:15" (3/4) ... [2022-02-24 00:31:15,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2fe70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:31:15, skipping insertion in model container [2022-02-24 00:31:15,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:31:15" (4/4) ... [2022-02-24 00:31:15,872 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.cqvasr [2022-02-24 00:31:15,876 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-24 00:31:15,876 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 00:31:15,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 00:31:15,919 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-24 00:31:15,920 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 00:31:15,939 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-02-24 00:31:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 00:31:15,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:15,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:31:15,945 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 685042341, now seen corresponding path program 1 times [2022-02-24 00:31:15,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:15,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020439296] [2022-02-24 00:31:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:16,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:16,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020439296] [2022-02-24 00:31:16,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020439296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:16,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:16,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 00:31:16,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829114587] [2022-02-24 00:31:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:16,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 00:31:16,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 00:31:16,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-24 00:31:16,441 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-02-24 00:31:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:17,430 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-02-24 00:31:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-24 00:31:17,433 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-02-24 00:31:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:17,443 INFO L225 Difference]: With dead ends: 415 [2022-02-24 00:31:17,443 INFO L226 Difference]: Without dead ends: 256 [2022-02-24 00:31:17,448 INFO L932 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-02-24 00:31:17,451 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:17,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-02-24 00:31:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-02-24 00:31:17,505 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-02-24 00:31:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-02-24 00:31:17,508 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-02-24 00:31:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:17,508 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-02-24 00:31:17,509 INFO L471 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-02-24 00:31:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-02-24 00:31:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 00:31:17,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:17,510 INFO L514 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-02-24 00:31:17,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 00:31:17,511 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1276904425, now seen corresponding path program 1 times [2022-02-24 00:31:17,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:17,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717541832] [2022-02-24 00:31:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:17,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:17,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717541832] [2022-02-24 00:31:17,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717541832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:17,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:17,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:31:17,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160151159] [2022-02-24 00:31:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:17,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:31:17,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:31:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:31:17,704 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-02-24 00:31:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:18,699 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-02-24 00:31:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:31:18,699 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-02-24 00:31:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:18,709 INFO L225 Difference]: With dead ends: 401 [2022-02-24 00:31:18,709 INFO L226 Difference]: Without dead ends: 343 [2022-02-24 00:31:18,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:18,716 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 380 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:18,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 495 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-24 00:31:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-02-24 00:31:18,780 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-02-24 00:31:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-02-24 00:31:18,783 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-02-24 00:31:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:18,783 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-02-24 00:31:18,784 INFO L471 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-02-24 00:31:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-02-24 00:31:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 00:31:18,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:18,786 INFO L514 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-02-24 00:31:18,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 00:31:18,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash 42368072, now seen corresponding path program 1 times [2022-02-24 00:31:18,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:18,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263692528] [2022-02-24 00:31:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:18,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:18,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263692528] [2022-02-24 00:31:18,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263692528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:18,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:18,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:31:18,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97512458] [2022-02-24 00:31:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:18,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:31:18,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:31:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:31:18,939 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-02-24 00:31:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:19,554 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-02-24 00:31:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:31:19,554 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-02-24 00:31:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:19,557 INFO L225 Difference]: With dead ends: 478 [2022-02-24 00:31:19,557 INFO L226 Difference]: Without dead ends: 362 [2022-02-24 00:31:19,558 INFO L932 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-02-24 00:31:19,559 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 404 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:19,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 379 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-02-24 00:31:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-02-24 00:31:19,610 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-02-24 00:31:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-02-24 00:31:19,614 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-02-24 00:31:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:19,615 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-02-24 00:31:19,615 INFO L471 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-02-24 00:31:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-02-24 00:31:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-24 00:31:19,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:19,621 INFO L514 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-02-24 00:31:19,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 00:31:19,622 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1039161410, now seen corresponding path program 1 times [2022-02-24 00:31:19,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:19,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766485781] [2022-02-24 00:31:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:19,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:19,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766485781] [2022-02-24 00:31:19,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766485781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:19,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:19,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:31:19,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586323450] [2022-02-24 00:31:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:19,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:31:19,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:31:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:31:19,758 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-02-24 00:31:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:20,232 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-02-24 00:31:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:31:20,233 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-02-24 00:31:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:20,235 INFO L225 Difference]: With dead ends: 344 [2022-02-24 00:31:20,235 INFO L226 Difference]: Without dead ends: 340 [2022-02-24 00:31:20,236 INFO L932 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-02-24 00:31:20,236 INFO L933 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-02-24 00:31:20,237 INFO L934 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-02-24 00:31:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-02-24 00:31:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-02-24 00:31:20,256 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-02-24 00:31:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-02-24 00:31:20,258 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-02-24 00:31:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:20,259 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-02-24 00:31:20,259 INFO L471 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-02-24 00:31:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-02-24 00:31:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-24 00:31:20,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:20,261 INFO L514 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-02-24 00:31:20,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 00:31:20,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash 827623692, now seen corresponding path program 1 times [2022-02-24 00:31:20,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:20,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074807254] [2022-02-24 00:31:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:20,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:20,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074807254] [2022-02-24 00:31:20,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074807254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:20,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:20,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:20,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007130163] [2022-02-24 00:31:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:20,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:20,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:20,400 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-02-24 00:31:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:21,113 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-02-24 00:31:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:21,114 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-02-24 00:31:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:21,116 INFO L225 Difference]: With dead ends: 385 [2022-02-24 00:31:21,116 INFO L226 Difference]: Without dead ends: 319 [2022-02-24 00:31:21,116 INFO L932 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-02-24 00:31:21,117 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 595 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:21,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 542 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-02-24 00:31:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-02-24 00:31:21,138 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-02-24 00:31:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-02-24 00:31:21,140 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-02-24 00:31:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:21,140 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-02-24 00:31:21,140 INFO L471 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-02-24 00:31:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-02-24 00:31:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-24 00:31:21,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:21,142 INFO L514 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-02-24 00:31:21,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 00:31:21,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1073883700, now seen corresponding path program 1 times [2022-02-24 00:31:21,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:21,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074502854] [2022-02-24 00:31:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 00:31:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:21,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:21,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074502854] [2022-02-24 00:31:21,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074502854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:21,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:21,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:21,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335200488] [2022-02-24 00:31:21,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:21,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:21,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:21,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:21,381 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-02-24 00:31:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:22,309 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-02-24 00:31:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:22,309 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-02-24 00:31:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:22,311 INFO L225 Difference]: With dead ends: 327 [2022-02-24 00:31:22,311 INFO L226 Difference]: Without dead ends: 322 [2022-02-24 00:31:22,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:22,313 INFO L933 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.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:22,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 465 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-24 00:31:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-02-24 00:31:22,333 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-02-24 00:31:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-02-24 00:31:22,335 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-02-24 00:31:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:22,335 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-02-24 00:31:22,336 INFO L471 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-02-24 00:31:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-02-24 00:31:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-24 00:31:22,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:22,337 INFO L514 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-02-24 00:31:22,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 00:31:22,337 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1039481029, now seen corresponding path program 1 times [2022-02-24 00:31:22,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:22,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603387247] [2022-02-24 00:31:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 00:31:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:22,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:22,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603387247] [2022-02-24 00:31:22,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603387247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:22,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:22,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:22,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672943219] [2022-02-24 00:31:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:22,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:22,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:22,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:22,588 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-02-24 00:31:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:23,351 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-02-24 00:31:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:23,352 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-02-24 00:31:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:23,353 INFO L225 Difference]: With dead ends: 327 [2022-02-24 00:31:23,354 INFO L226 Difference]: Without dead ends: 322 [2022-02-24 00:31:23,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:23,355 INFO L933 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.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:23,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [921 Valid, 415 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-24 00:31:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-02-24 00:31:23,375 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-02-24 00:31:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-02-24 00:31:23,377 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-02-24 00:31:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:23,377 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-02-24 00:31:23,378 INFO L471 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-02-24 00:31:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-02-24 00:31:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 00:31:23,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:23,379 INFO L514 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-02-24 00:31:23,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 00:31:23,379 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2137589877, now seen corresponding path program 1 times [2022-02-24 00:31:23,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:23,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96800213] [2022-02-24 00:31:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 00:31:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:23,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:23,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96800213] [2022-02-24 00:31:23,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96800213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:23,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:23,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:23,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411878531] [2022-02-24 00:31:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:23,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:23,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:23,508 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-02-24 00:31:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:23,808 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-02-24 00:31:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:23,809 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-02-24 00:31:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:23,813 INFO L225 Difference]: With dead ends: 330 [2022-02-24 00:31:23,813 INFO L226 Difference]: Without dead ends: 102 [2022-02-24 00:31:23,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:23,815 INFO L933 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-02-24 00:31:23,815 INFO L934 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-02-24 00:31:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-24 00:31:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-24 00:31:23,823 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-02-24 00:31:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-02-24 00:31:23,824 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-02-24 00:31:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:23,825 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-02-24 00:31:23,825 INFO L471 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-02-24 00:31:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-02-24 00:31:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-24 00:31:23,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:23,825 INFO L514 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-02-24 00:31:23,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 00:31:23,826 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1910683918, now seen corresponding path program 1 times [2022-02-24 00:31:23,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:23,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082506553] [2022-02-24 00:31:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:31:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 00:31:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:23,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:23,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082506553] [2022-02-24 00:31:23,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082506553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:23,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:23,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:23,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691207915] [2022-02-24 00:31:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:23,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:23,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:23,973 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-02-24 00:31:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:24,260 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-02-24 00:31:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:24,261 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-02-24 00:31:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:24,263 INFO L225 Difference]: With dead ends: 130 [2022-02-24 00:31:24,263 INFO L226 Difference]: Without dead ends: 100 [2022-02-24 00:31:24,263 INFO L932 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-02-24 00:31:24,265 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:24,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 209 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:31:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-24 00:31:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-24 00:31:24,277 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-02-24 00:31:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-02-24 00:31:24,278 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-02-24 00:31:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:24,279 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-02-24 00:31:24,279 INFO L471 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-02-24 00:31:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-02-24 00:31:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-24 00:31:24,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:24,280 INFO L514 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-02-24 00:31:24,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 00:31:24,280 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -948674633, now seen corresponding path program 1 times [2022-02-24 00:31:24,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:24,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60669843] [2022-02-24 00:31:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:24,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:24,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60669843] [2022-02-24 00:31:24,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60669843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:24,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:24,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:24,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594500889] [2022-02-24 00:31:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:24,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:24,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:24,475 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-02-24 00:31:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:24,696 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-02-24 00:31:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:24,696 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-02-24 00:31:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:24,697 INFO L225 Difference]: With dead ends: 152 [2022-02-24 00:31:24,697 INFO L226 Difference]: Without dead ends: 111 [2022-02-24 00:31:24,697 INFO L932 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-02-24 00:31:24,698 INFO L933 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-02-24 00:31:24,698 INFO L934 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-02-24 00:31:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-24 00:31:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-02-24 00:31:24,707 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-02-24 00:31:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-02-24 00:31:24,708 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-02-24 00:31:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:24,708 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-02-24 00:31:24,708 INFO L471 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-02-24 00:31:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-02-24 00:31:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-24 00:31:24,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:24,709 INFO L514 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-02-24 00:31:24,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 00:31:24,710 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1641862871, now seen corresponding path program 1 times [2022-02-24 00:31:24,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:24,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750399866] [2022-02-24 00:31:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:24,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:24,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750399866] [2022-02-24 00:31:24,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750399866] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:24,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:24,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:24,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126900860] [2022-02-24 00:31:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:24,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:24,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:24,897 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-02-24 00:31:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:25,109 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-02-24 00:31:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:31:25,109 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-02-24 00:31:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:25,110 INFO L225 Difference]: With dead ends: 116 [2022-02-24 00:31:25,110 INFO L226 Difference]: Without dead ends: 109 [2022-02-24 00:31:25,111 INFO L932 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-02-24 00:31:25,111 INFO L933 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-02-24 00:31:25,112 INFO L934 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-02-24 00:31:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-24 00:31:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-02-24 00:31:25,121 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-02-24 00:31:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-02-24 00:31:25,121 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-02-24 00:31:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:25,122 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-02-24 00:31:25,122 INFO L471 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-02-24 00:31:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-02-24 00:31:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-24 00:31:25,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:25,123 INFO L514 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-02-24 00:31:25,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 00:31:25,123 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1083966817, now seen corresponding path program 1 times [2022-02-24 00:31:25,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:25,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025038201] [2022-02-24 00:31:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,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-02-24 00:31:25,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:25,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025038201] [2022-02-24 00:31:25,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025038201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:25,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:25,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:25,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943876465] [2022-02-24 00:31:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:25,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:25,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:25,256 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-02-24 00:31:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:25,541 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2022-02-24 00:31:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:25,542 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-02-24 00:31:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:25,543 INFO L225 Difference]: With dead ends: 203 [2022-02-24 00:31:25,543 INFO L226 Difference]: Without dead ends: 196 [2022-02-24 00:31:25,544 INFO L932 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-02-24 00:31:25,544 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-24 00:31:25,545 INFO L934 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-02-24 00:31:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-24 00:31:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2022-02-24 00:31:25,564 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-02-24 00:31:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2022-02-24 00:31:25,566 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 58 [2022-02-24 00:31:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:25,566 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2022-02-24 00:31:25,566 INFO L471 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-02-24 00:31:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2022-02-24 00:31:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-24 00:31:25,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:25,569 INFO L514 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-02-24 00:31:25,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 00:31:25,569 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1971470498, now seen corresponding path program 1 times [2022-02-24 00:31:25,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:25,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644948503] [2022-02-24 00:31:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:25,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:25,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644948503] [2022-02-24 00:31:25,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644948503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:25,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:25,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:25,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696216977] [2022-02-24 00:31:25,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:25,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:25,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:25,768 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-02-24 00:31:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:25,893 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2022-02-24 00:31:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:25,893 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-02-24 00:31:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:25,894 INFO L225 Difference]: With dead ends: 248 [2022-02-24 00:31:25,894 INFO L226 Difference]: Without dead ends: 172 [2022-02-24 00:31:25,895 INFO L932 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-02-24 00:31:25,895 INFO L933 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-02-24 00:31:25,896 INFO L934 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-02-24 00:31:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-24 00:31:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-02-24 00:31:25,908 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-02-24 00:31:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2022-02-24 00:31:25,909 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 58 [2022-02-24 00:31:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2022-02-24 00:31:25,910 INFO L471 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-02-24 00:31:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2022-02-24 00:31:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-24 00:31:25,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:25,911 INFO L514 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-02-24 00:31:25,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 00:31:25,911 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2034770721, now seen corresponding path program 1 times [2022-02-24 00:31:25,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:25,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209719510] [2022-02-24 00:31:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:26,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:26,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209719510] [2022-02-24 00:31:26,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209719510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:26,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:26,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:26,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483927035] [2022-02-24 00:31:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:26,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:26,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:26,167 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-02-24 00:31:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:26,503 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-02-24 00:31:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:31:26,503 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-02-24 00:31:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:26,504 INFO L225 Difference]: With dead ends: 220 [2022-02-24 00:31:26,504 INFO L226 Difference]: Without dead ends: 156 [2022-02-24 00:31:26,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:26,505 INFO L933 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.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:26,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 204 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:31:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-24 00:31:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-24 00:31:26,521 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-02-24 00:31:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-02-24 00:31:26,522 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 62 [2022-02-24 00:31:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:26,522 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-02-24 00:31:26,522 INFO L471 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-02-24 00:31:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-02-24 00:31:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:26,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:26,523 INFO L514 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-02-24 00:31:26,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 00:31:26,523 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1057027574, now seen corresponding path program 1 times [2022-02-24 00:31:26,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:26,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951229136] [2022-02-24 00:31:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:26,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:26,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951229136] [2022-02-24 00:31:26,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951229136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:26,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:26,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:31:26,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438890568] [2022-02-24 00:31:26,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:26,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:31:26,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:31:26,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:31:26,675 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-02-24 00:31:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:26,830 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2022-02-24 00:31:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 00:31:26,831 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-02-24 00:31:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:26,832 INFO L225 Difference]: With dead ends: 216 [2022-02-24 00:31:26,832 INFO L226 Difference]: Without dead ends: 168 [2022-02-24 00:31:26,832 INFO L932 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-02-24 00:31:26,833 INFO L933 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-02-24 00:31:26,833 INFO L934 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-02-24 00:31:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-24 00:31:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-02-24 00:31:26,846 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-02-24 00:31:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-02-24 00:31:26,847 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 64 [2022-02-24 00:31:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:26,847 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-02-24 00:31:26,847 INFO L471 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-02-24 00:31:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-02-24 00:31:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:26,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:26,852 INFO L514 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-02-24 00:31:26,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 00:31:26,853 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 763624567, now seen corresponding path program 1 times [2022-02-24 00:31:26,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:26,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358017769] [2022-02-24 00:31:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:26,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:26,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358017769] [2022-02-24 00:31:26,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358017769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:26,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:26,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:31:26,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548831827] [2022-02-24 00:31:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:26,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:31:26,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:31:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:31:26,989 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-02-24 00:31:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:27,168 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-02-24 00:31:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:27,168 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-02-24 00:31:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:27,170 INFO L225 Difference]: With dead ends: 182 [2022-02-24 00:31:27,170 INFO L226 Difference]: Without dead ends: 177 [2022-02-24 00:31:27,170 INFO L932 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-02-24 00:31:27,171 INFO L933 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-02-24 00:31:27,171 INFO L934 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-02-24 00:31:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-24 00:31:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2022-02-24 00:31:27,185 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-02-24 00:31:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-02-24 00:31:27,186 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 64 [2022-02-24 00:31:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:27,187 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-02-24 00:31:27,187 INFO L471 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-02-24 00:31:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-02-24 00:31:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:27,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:27,188 INFO L514 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-02-24 00:31:27,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 00:31:27,188 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1206614856, now seen corresponding path program 1 times [2022-02-24 00:31:27,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:27,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184578360] [2022-02-24 00:31:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:27,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:27,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184578360] [2022-02-24 00:31:27,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184578360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:27,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:27,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:27,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910488255] [2022-02-24 00:31:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:27,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:27,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:27,386 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-02-24 00:31:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:27,565 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2022-02-24 00:31:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:31:27,566 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-02-24 00:31:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:27,567 INFO L225 Difference]: With dead ends: 182 [2022-02-24 00:31:27,567 INFO L226 Difference]: Without dead ends: 175 [2022-02-24 00:31:27,568 INFO L932 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-02-24 00:31:27,568 INFO L933 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-02-24 00:31:27,568 INFO L934 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-02-24 00:31:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-24 00:31:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2022-02-24 00:31:27,582 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-02-24 00:31:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-02-24 00:31:27,583 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 64 [2022-02-24 00:31:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:27,583 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-02-24 00:31:27,583 INFO L471 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-02-24 00:31:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-02-24 00:31:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-24 00:31:27,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:27,584 INFO L514 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-02-24 00:31:27,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 00:31:27,584 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2128246060, now seen corresponding path program 1 times [2022-02-24 00:31:27,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:27,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749038445] [2022-02-24 00:31:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:27,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:27,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749038445] [2022-02-24 00:31:27,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749038445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:27,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:27,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:27,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127555653] [2022-02-24 00:31:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:27,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:27,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:27,826 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-02-24 00:31:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:28,257 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-02-24 00:31:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:28,258 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-02-24 00:31:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:28,259 INFO L225 Difference]: With dead ends: 169 [2022-02-24 00:31:28,259 INFO L226 Difference]: Without dead ends: 144 [2022-02-24 00:31:28,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:28,260 INFO L933 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-02-24 00:31:28,260 INFO L934 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-02-24 00:31:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-24 00:31:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-24 00:31:28,272 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-02-24 00:31:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-02-24 00:31:28,273 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 65 [2022-02-24 00:31:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:28,273 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-02-24 00:31:28,274 INFO L471 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-02-24 00:31:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-02-24 00:31:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-24 00:31:28,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:28,274 INFO L514 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-02-24 00:31:28,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 00:31:28,275 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1266450091, now seen corresponding path program 1 times [2022-02-24 00:31:28,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:28,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802219659] [2022-02-24 00:31:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:28,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:28,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802219659] [2022-02-24 00:31:28,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802219659] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:28,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:28,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:31:28,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688546220] [2022-02-24 00:31:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:28,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:31:28,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:31:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:31:28,431 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-02-24 00:31:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:28,600 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-02-24 00:31:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:28,601 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-02-24 00:31:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:28,602 INFO L225 Difference]: With dead ends: 169 [2022-02-24 00:31:28,602 INFO L226 Difference]: Without dead ends: 137 [2022-02-24 00:31:28,602 INFO L932 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-02-24 00:31:28,603 INFO L933 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-02-24 00:31:28,603 INFO L934 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-02-24 00:31:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-24 00:31:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-24 00:31:28,613 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-02-24 00:31:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2022-02-24 00:31:28,614 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 65 [2022-02-24 00:31:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:28,614 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2022-02-24 00:31:28,614 INFO L471 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-02-24 00:31:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-02-24 00:31:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-24 00:31:28,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:28,615 INFO L514 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-02-24 00:31:28,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 00:31:28,615 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 79966819, now seen corresponding path program 1 times [2022-02-24 00:31:28,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:28,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002022372] [2022-02-24 00:31:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:28,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:28,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002022372] [2022-02-24 00:31:28,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002022372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:28,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:28,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:28,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971954883] [2022-02-24 00:31:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:28,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:28,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:28,835 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-02-24 00:31:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:29,021 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2022-02-24 00:31:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:31:29,022 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-02-24 00:31:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:29,022 INFO L225 Difference]: With dead ends: 148 [2022-02-24 00:31:29,023 INFO L226 Difference]: Without dead ends: 137 [2022-02-24 00:31:29,023 INFO L932 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-02-24 00:31:29,023 INFO L933 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.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:29,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 272 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:31:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-24 00:31:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-24 00:31:29,035 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-02-24 00:31:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-02-24 00:31:29,036 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 65 [2022-02-24 00:31:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:29,036 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-02-24 00:31:29,036 INFO L471 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-02-24 00:31:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-02-24 00:31:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-24 00:31:29,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:29,037 INFO L514 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-02-24 00:31:29,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-24 00:31:29,037 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -117181948, now seen corresponding path program 1 times [2022-02-24 00:31:29,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:29,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021747637] [2022-02-24 00:31:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-24 00:31:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:29,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:29,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021747637] [2022-02-24 00:31:29,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021747637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:29,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:29,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:29,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147987759] [2022-02-24 00:31:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:29,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:29,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:29,191 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-02-24 00:31:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:29,339 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-02-24 00:31:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:29,339 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-02-24 00:31:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:29,341 INFO L225 Difference]: With dead ends: 137 [2022-02-24 00:31:29,341 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 00:31:29,342 INFO L932 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-02-24 00:31:29,342 INFO L933 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-02-24 00:31:29,342 INFO L934 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-02-24 00:31:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 00:31:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 00:31:29,345 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-02-24 00:31:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 00:31:29,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-02-24 00:31:29,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:29,346 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 00:31:29,346 INFO L471 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-02-24 00:31:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 00:31:29,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 00:31:29,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 00:31:29,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-24 00:31:29,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 00:31:33,522 INFO L854 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-02-24 00:31:33,522 INFO L858 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 568 575) no Hoare annotation was computed. [2022-02-24 00:31:33,522 INFO L858 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 568 575) no Hoare annotation was computed. [2022-02-24 00:31:33,522 INFO L854 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-02-24 00:31:33,523 INFO L854 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-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2022-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2022-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-02-24 00:31:33,523 INFO L854 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-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 43 56) no Hoare annotation was computed. [2022-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 43 56) no Hoare annotation was computed. [2022-02-24 00:31:33,523 INFO L854 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-02-24 00:31:33,523 INFO L858 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L854 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-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L854 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-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L854 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-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L854 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-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point KbFilter_PowerFINAL(lines 689 744) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L858 garLoopResultBuilder]: For program point KbFilter_PowerEXIT(lines 689 744) no Hoare annotation was computed. [2022-02-24 00:31:33,524 INFO L854 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-02-24 00:31:33,525 INFO L858 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 57 78) no Hoare annotation was computed. [2022-02-24 00:31:33,525 INFO L858 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 57 78) no Hoare annotation was computed. [2022-02-24 00:31:33,525 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-02-24 00:31:33,525 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-02-24 00:31:33,525 INFO L858 garLoopResultBuilder]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2022-02-24 00:31:33,525 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L854 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-02-24 00:31:33,526 INFO L854 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-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L328-1(lines 324 465) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L854 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-02-24 00:31:33,526 INFO L854 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-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L854 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-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L344(lines 330 413) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-02-24 00:31:33,526 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-02-24 00:31:33,527 INFO L854 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-02-24 00:31:33,527 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 295 466) no Hoare annotation was computed. [2022-02-24 00:31:33,527 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-02-24 00:31:33,527 INFO L858 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-02-24 00:31:33,527 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 295 466) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L854 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-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L854 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-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-02-24 00:31:33,528 INFO L854 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-02-24 00:31:33,528 INFO L858 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L854 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-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L854 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-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L854 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-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L858 garLoopResultBuilder]: For program point L395(line 395) no Hoare annotation was computed. [2022-02-24 00:31:33,529 INFO L854 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-02-24 00:31:33,530 INFO L854 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-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point L400(line 400) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L854 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-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2022-02-24 00:31:33,530 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-02-24 00:31:33,531 INFO L854 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-02-24 00:31:33,531 INFO L858 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2022-02-24 00:31:33,531 INFO L854 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-02-24 00:31:33,531 INFO L854 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-02-24 00:31:33,531 INFO L854 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-02-24 00:31:33,531 INFO L854 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-02-24 00:31:33,531 INFO L858 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-02-24 00:31:33,532 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-02-24 00:31:33,532 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-02-24 00:31:33,532 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2022-02-24 00:31:33,532 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-02-24 00:31:33,532 INFO L854 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-02-24 00:31:33,533 INFO L854 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-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L854 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-02-24 00:31:33,533 INFO L854 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-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point PoCallDriverFINAL(lines 745 821) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point PoCallDriverEXIT(lines 745 821) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L854 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-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2022-02-24 00:31:33,533 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L858 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-02-24 00:31:33,534 INFO L854 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-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-02-24 00:31:33,536 INFO L854 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-02-24 00:31:33,536 INFO L858 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,537 INFO L858 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2022-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,537 INFO L854 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-02-24 00:31:33,538 INFO L854 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-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point KbFilter_InternIoCtlFINAL(lines 822 1007) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point KbFilter_InternIoCtlEXIT(lines 822 1007) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-02-24 00:31:33,538 INFO L858 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L854 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-02-24 00:31:33,539 INFO L854 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-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 576 617) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 576 617) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L854 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-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-02-24 00:31:33,539 INFO L854 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-02-24 00:31:33,539 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-02-24 00:31:33,540 INFO L854 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-02-24 00:31:33,540 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-02-24 00:31:33,540 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-02-24 00:31:33,540 INFO L854 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-02-24 00:31:33,540 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-02-24 00:31:33,540 INFO L854 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-02-24 00:31:33,540 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 00:31:33,541 INFO L854 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-02-24 00:31:33,541 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-24 00:31:33,541 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-24 00:31:33,541 INFO L854 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-02-24 00:31:33,541 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-02-24 00:31:33,541 INFO L858 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L854 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-02-24 00:31:33,542 INFO L854 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-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L854 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-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L854 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-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-02-24 00:31:33,542 INFO L854 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-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L854 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-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L854 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-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-02-24 00:31:33,543 INFO L854 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-02-24 00:31:33,543 INFO L854 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-02-24 00:31:33,544 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2022-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,544 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2022-02-24 00:31:33,544 INFO L854 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-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 81 294) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 81 294) no Hoare annotation was computed. [2022-02-24 00:31:33,545 INFO L854 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-02-24 00:31:33,545 INFO L858 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L201-1(lines 201 203) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L854 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-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2022-02-24 00:31:33,546 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2022-02-24 00:31:33,547 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2022-02-24 00:31:33,547 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2022-02-24 00:31:33,547 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2022-02-24 00:31:33,547 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2022-02-24 00:31:33,551 INFO L732 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-02-24 00:31:33,555 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 00:31:33,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:31:33 BasicIcfg [2022-02-24 00:31:33,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 00:31:33,622 INFO L158 Benchmark]: Toolchain (without parser) took 19171.89ms. Allocated memory was 177.2MB in the beginning and 332.4MB in the end (delta: 155.2MB). Free memory was 123.6MB in the beginning and 200.7MB in the end (delta: -77.1MB). Peak memory consumption was 167.4MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,622 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 140.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 00:31:33,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.32ms. Allocated memory was 177.2MB in the beginning and 230.7MB in the end (delta: 53.5MB). Free memory was 123.4MB in the beginning and 200.2MB in the end (delta: -76.8MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,623 INFO L158 Benchmark]: Boogie Preprocessor took 91.09ms. Allocated memory is still 230.7MB. Free memory was 200.2MB in the beginning and 197.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,623 INFO L158 Benchmark]: RCFGBuilder took 826.92ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 163.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,623 INFO L158 Benchmark]: IcfgTransformer took 70.07ms. Allocated memory is still 230.7MB. Free memory was 163.0MB in the beginning and 158.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,623 INFO L158 Benchmark]: TraceAbstraction took 17755.31ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 158.3MB in the beginning and 200.7MB in the end (delta: -42.4MB). Peak memory consumption was 148.4MB. Max. memory is 8.0GB. [2022-02-24 00:31:33,624 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.13ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 140.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.32ms. Allocated memory was 177.2MB in the beginning and 230.7MB in the end (delta: 53.5MB). Free memory was 123.4MB in the beginning and 200.2MB in the end (delta: -76.8MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 91.09ms. Allocated memory is still 230.7MB. Free memory was 200.2MB in the beginning and 197.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 826.92ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 163.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * IcfgTransformer took 70.07ms. Allocated memory is still 230.7MB. Free memory was 163.0MB in the beginning and 158.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17755.31ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 158.3MB in the beginning and 200.7MB in the end (delta: -42.4MB). Peak memory consumption was 148.4MB. 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: 17.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5636 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5619 mSDsluCounter, 6425 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3245 mSDsCounter, 1305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6402 IncrementalHoareTripleChecker+Invalid, 7707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1305 mSolverCounterUnsat, 3180 mSDtfsCounter, 6402 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.4s 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.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 380 PreInvPairs, 484 NumberOfFragments, 4195 HoareAnnotationTreeSize, 380 FomulaSimplifications, 908 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 84 FomulaSimplificationsInter, 6392 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s 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-02-24 00:31:33,679 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...