/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 02:29:31,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 02:29:31,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 02:29:31,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 02:29:31,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 02:29:31,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 02:29:31,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 02:29:31,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 02:29:31,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 02:29:31,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 02:29:31,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 02:29:31,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 02:29:31,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 02:29:31,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 02:29:31,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 02:29:31,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 02:29:31,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 02:29:31,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 02:29:31,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 02:29:31,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 02:29:31,357 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 02:29:31,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 02:29:31,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 02:29:31,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 02:29:31,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 02:29:31,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 02:29:31,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 02:29:31,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 02:29:31,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 02:29:31,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 02:29:31,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 02:29:31,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 02:29:31,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 02:29:31,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 02:29:31,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 02:29:31,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 02:29:31,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 02:29:31,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 02:29:31,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 02:29:31,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 02:29:31,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 02:29:31,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 02:29:31,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-20 02:29:31,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 02:29:31,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 02:29:31,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 02:29:31,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 02:29:31,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 02:29:31,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 02:29:31,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 02:29:31,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 02:29:31,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 02:29:31,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:31,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 02:29:31,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 02:29:31,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 02:29:31,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 02:29:31,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 02:29:31,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 02:29:31,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 02:29:31,566 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 02:29:31,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-03-20 02:29:31,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b463974/eefc67a3ab2745078fdb9835ce92a314/FLAGa215522dd [2022-03-20 02:29:32,010 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 02:29:32,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-03-20 02:29:32,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b463974/eefc67a3ab2745078fdb9835ce92a314/FLAGa215522dd [2022-03-20 02:29:32,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b463974/eefc67a3ab2745078fdb9835ce92a314 [2022-03-20 02:29:32,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 02:29:32,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 02:29:32,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:32,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 02:29:32,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 02:29:32,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e277dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32, skipping insertion in model container [2022-03-20 02:29:32,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 02:29:32,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 02:29:32,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-03-20 02:29:32,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:32,260 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 02:29:32,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-03-20 02:29:32,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:32,299 INFO L208 MainTranslator]: Completed translation [2022-03-20 02:29:32,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32 WrapperNode [2022-03-20 02:29:32,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:32,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 02:29:32,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 02:29:32,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 02:29:32,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 02:29:32,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 02:29:32,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 02:29:32,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 02:29:32,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (1/1) ... [2022-03-20 02:29:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:32,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 02:29:32,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 02:29:32,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 02:29:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 02:29:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 02:29:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 02:29:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 02:29:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-03-20 02:29:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 02:29:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 02:29:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 02:29:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 02:29:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 02:29:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 02:29:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 02:29:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 02:29:32,473 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 02:29:32,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 02:29:32,569 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:32,617 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-03-20 02:29:32,618 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-03-20 02:29:32,619 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:32,639 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-03-20 02:29:32,640 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-03-20 02:29:32,651 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:32,662 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 02:29:32,663 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 02:29:32,669 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:32,741 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-03-20 02:29:32,742 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-03-20 02:29:32,745 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 02:29:32,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 02:29:32,751 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-20 02:29:32,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:32 BoogieIcfgContainer [2022-03-20 02:29:32,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 02:29:32,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 02:29:32,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 02:29:32,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 02:29:32,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 02:29:32" (1/3) ... [2022-03-20 02:29:32,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66951282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:32, skipping insertion in model container [2022-03-20 02:29:32,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:32" (2/3) ... [2022-03-20 02:29:32,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66951282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:32, skipping insertion in model container [2022-03-20 02:29:32,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:32" (3/3) ... [2022-03-20 02:29:32,765 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-03-20 02:29:32,770 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 02:29:32,770 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 02:29:32,806 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 02:29:32,812 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 02:29:32,813 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 02:29:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-20 02:29:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 02:29:32,839 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:32,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:32,840 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-03-20 02:29:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433154734] [2022-03-20 02:29:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:33,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433154734] [2022-03-20 02:29:33,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433154734] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:33,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:33,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:29:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142754323] [2022-03-20 02:29:33,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:33,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:29:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:33,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:29:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:33,188 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 02:29:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:33,635 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-03-20 02:29:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:29:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-20 02:29:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:33,644 INFO L225 Difference]: With dead ends: 302 [2022-03-20 02:29:33,644 INFO L226 Difference]: Without dead ends: 157 [2022-03-20 02:29:33,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:33,649 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:33,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-20 02:29:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-03-20 02:29:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-20 02:29:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-03-20 02:29:33,688 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-03-20 02:29:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:33,688 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-03-20 02:29:33,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 02:29:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-03-20 02:29:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 02:29:33,689 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:33,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:33,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 02:29:33,689 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-03-20 02:29:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:33,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053081958] [2022-03-20 02:29:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053081958] [2022-03-20 02:29:33,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053081958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:33,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:33,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417271133] [2022-03-20 02:29:33,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:33,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:33,834 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:34,156 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-03-20 02:29:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:29:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-03-20 02:29:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:34,159 INFO L225 Difference]: With dead ends: 275 [2022-03-20 02:29:34,159 INFO L226 Difference]: Without dead ends: 219 [2022-03-20 02:29:34,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:34,161 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 294 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:34,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 284 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-20 02:29:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-03-20 02:29:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-03-20 02:29:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-03-20 02:29:34,180 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-03-20 02:29:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:34,180 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-03-20 02:29:34,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-03-20 02:29:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 02:29:34,181 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:34,181 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:34,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 02:29:34,181 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-03-20 02:29:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:34,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081124693] [2022-03-20 02:29:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081124693] [2022-03-20 02:29:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081124693] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:34,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452996752] [2022-03-20 02:29:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:34,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:34,303 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:34,540 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-03-20 02:29:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:29:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-03-20 02:29:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:34,542 INFO L225 Difference]: With dead ends: 316 [2022-03-20 02:29:34,542 INFO L226 Difference]: Without dead ends: 254 [2022-03-20 02:29:34,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:34,544 INFO L913 BasicCegarLoop]: 160 mSDtfsCounter, 325 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:34,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 241 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-20 02:29:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-03-20 02:29:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 02:29:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-03-20 02:29:34,559 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-03-20 02:29:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:34,559 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-03-20 02:29:34,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-03-20 02:29:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-20 02:29:34,561 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:34,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:34,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 02:29:34,561 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-03-20 02:29:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:34,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401597977] [2022-03-20 02:29:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:34,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401597977] [2022-03-20 02:29:34,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401597977] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:34,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:34,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007189622] [2022-03-20 02:29:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:34,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:34,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:34,668 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:34,911 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-03-20 02:29:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:29:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-03-20 02:29:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:34,913 INFO L225 Difference]: With dead ends: 220 [2022-03-20 02:29:34,913 INFO L226 Difference]: Without dead ends: 217 [2022-03-20 02:29:34,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:34,914 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 190 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:34,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 233 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-03-20 02:29:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-03-20 02:29:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-03-20 02:29:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-03-20 02:29:34,926 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-03-20 02:29:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:34,927 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-03-20 02:29:34,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-03-20 02:29:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 02:29:34,928 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:34,929 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:34,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 02:29:34,929 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-03-20 02:29:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:34,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209065177] [2022-03-20 02:29:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209065177] [2022-03-20 02:29:35,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209065177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:35,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:35,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078412561] [2022-03-20 02:29:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:35,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:35,074 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 02:29:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:35,483 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-03-20 02:29:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-03-20 02:29:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:35,484 INFO L225 Difference]: With dead ends: 274 [2022-03-20 02:29:35,484 INFO L226 Difference]: Without dead ends: 208 [2022-03-20 02:29:35,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:29:35,486 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 299 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:35,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 436 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-20 02:29:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-03-20 02:29:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 02:29:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-03-20 02:29:35,495 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-03-20 02:29:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:35,496 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-03-20 02:29:35,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 02:29:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-03-20 02:29:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 02:29:35,497 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:35,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:35,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 02:29:35,497 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-03-20 02:29:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188962180] [2022-03-20 02:29:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 02:29:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 02:29:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:35,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188962180] [2022-03-20 02:29:35,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188962180] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:35,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:35,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247960871] [2022-03-20 02:29:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:35,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:35,620 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:29:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:35,904 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-03-20 02:29:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:35,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-03-20 02:29:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:35,906 INFO L225 Difference]: With dead ends: 258 [2022-03-20 02:29:35,906 INFO L226 Difference]: Without dead ends: 197 [2022-03-20 02:29:35,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:35,907 INFO L913 BasicCegarLoop]: 160 mSDtfsCounter, 269 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:35,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 339 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-20 02:29:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-03-20 02:29:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-03-20 02:29:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-03-20 02:29:35,917 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-03-20 02:29:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:35,917 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-03-20 02:29:35,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:29:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-03-20 02:29:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 02:29:35,927 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:35,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:35,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 02:29:35,928 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:35,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-03-20 02:29:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387476463] [2022-03-20 02:29:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 02:29:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:36,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:36,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387476463] [2022-03-20 02:29:36,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387476463] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:36,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:36,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509384749] [2022-03-20 02:29:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:36,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:36,117 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:36,689 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-03-20 02:29:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:29:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-20 02:29:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:36,690 INFO L225 Difference]: With dead ends: 234 [2022-03-20 02:29:36,690 INFO L226 Difference]: Without dead ends: 210 [2022-03-20 02:29:36,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-20 02:29:36,691 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 411 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:36,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 434 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-20 02:29:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-03-20 02:29:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-03-20 02:29:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-03-20 02:29:36,701 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-03-20 02:29:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:36,701 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-03-20 02:29:36,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-03-20 02:29:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 02:29:36,702 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:36,702 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:36,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 02:29:36,703 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-03-20 02:29:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:36,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385750727] [2022-03-20 02:29:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 02:29:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:36,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385750727] [2022-03-20 02:29:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385750727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:36,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840968210] [2022-03-20 02:29:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:36,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:36,869 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:37,220 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-03-20 02:29:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 02:29:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-03-20 02:29:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:37,221 INFO L225 Difference]: With dead ends: 203 [2022-03-20 02:29:37,222 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 02:29:37,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:37,223 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 531 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:37,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 266 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:29:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 02:29:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 02:29:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-03-20 02:29:37,229 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-03-20 02:29:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:37,229 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-03-20 02:29:37,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-03-20 02:29:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 02:29:37,230 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:37,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:37,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 02:29:37,230 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-03-20 02:29:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:37,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331462414] [2022-03-20 02:29:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331462414] [2022-03-20 02:29:37,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331462414] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:37,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:37,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073464361] [2022-03-20 02:29:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:37,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:37,412 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:37,706 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-03-20 02:29:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:29:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-03-20 02:29:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:37,707 INFO L225 Difference]: With dead ends: 119 [2022-03-20 02:29:37,707 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 02:29:37,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:29:37,708 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 97 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:37,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 215 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 02:29:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 02:29:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 02:29:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-03-20 02:29:37,714 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-03-20 02:29:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:37,714 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-03-20 02:29:37,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-03-20 02:29:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 02:29:37,714 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:37,715 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:37,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 02:29:37,715 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-03-20 02:29:37,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:37,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139154686] [2022-03-20 02:29:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:37,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139154686] [2022-03-20 02:29:37,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139154686] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:37,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:37,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393424337] [2022-03-20 02:29:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:37,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:37,838 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:37,951 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-03-20 02:29:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 02:29:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-03-20 02:29:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:37,952 INFO L225 Difference]: With dead ends: 125 [2022-03-20 02:29:37,952 INFO L226 Difference]: Without dead ends: 97 [2022-03-20 02:29:37,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:37,953 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:37,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 188 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-20 02:29:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-03-20 02:29:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-03-20 02:29:37,959 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-03-20 02:29:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:37,959 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-03-20 02:29:37,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-03-20 02:29:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 02:29:37,960 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:37,960 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:37,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 02:29:37,960 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-03-20 02:29:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:37,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608887421] [2022-03-20 02:29:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:38,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608887421] [2022-03-20 02:29:38,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608887421] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:38,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:38,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582090209] [2022-03-20 02:29:38,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:38,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:38,115 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:38,275 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-03-20 02:29:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-03-20 02:29:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:38,276 INFO L225 Difference]: With dead ends: 112 [2022-03-20 02:29:38,276 INFO L226 Difference]: Without dead ends: 93 [2022-03-20 02:29:38,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:38,276 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 84 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:38,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 318 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-20 02:29:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-03-20 02:29:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-03-20 02:29:38,282 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-03-20 02:29:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:38,282 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-03-20 02:29:38,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-03-20 02:29:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 02:29:38,282 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:38,282 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:38,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 02:29:38,283 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-03-20 02:29:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:38,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337020760] [2022-03-20 02:29:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:38,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:38,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337020760] [2022-03-20 02:29:38,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337020760] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:38,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:38,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75835311] [2022-03-20 02:29:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:38,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:38,399 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:38,524 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-03-20 02:29:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 02:29:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:38,525 INFO L225 Difference]: With dead ends: 105 [2022-03-20 02:29:38,525 INFO L226 Difference]: Without dead ends: 100 [2022-03-20 02:29:38,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:38,526 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:38,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 210 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-20 02:29:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-03-20 02:29:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-03-20 02:29:38,532 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-03-20 02:29:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:38,532 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-03-20 02:29:38,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-03-20 02:29:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-20 02:29:38,533 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:38,533 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:38,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 02:29:38,533 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-03-20 02:29:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:38,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518954116] [2022-03-20 02:29:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518954116] [2022-03-20 02:29:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518954116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:38,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:38,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458688124] [2022-03-20 02:29:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:38,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:38,699 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:38,833 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-03-20 02:29:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-03-20 02:29:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:38,834 INFO L225 Difference]: With dead ends: 98 [2022-03-20 02:29:38,834 INFO L226 Difference]: Without dead ends: 91 [2022-03-20 02:29:38,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:38,835 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 87 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:38,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 246 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-03-20 02:29:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-03-20 02:29:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-03-20 02:29:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-03-20 02:29:38,841 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-03-20 02:29:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:38,841 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-03-20 02:29:38,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-03-20 02:29:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:29:38,842 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:38,842 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:38,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 02:29:38,842 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-03-20 02:29:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:38,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952455411] [2022-03-20 02:29:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952455411] [2022-03-20 02:29:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952455411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896814645] [2022-03-20 02:29:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:38,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:38,985 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:39,131 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-03-20 02:29:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 02:29:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:39,132 INFO L225 Difference]: With dead ends: 107 [2022-03-20 02:29:39,132 INFO L226 Difference]: Without dead ends: 76 [2022-03-20 02:29:39,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:39,133 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:39,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-20 02:29:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-03-20 02:29:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 02:29:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-03-20 02:29:39,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-03-20 02:29:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:39,138 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-03-20 02:29:39,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-03-20 02:29:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:29:39,139 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:39,139 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:39,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 02:29:39,139 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-03-20 02:29:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:39,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680264926] [2022-03-20 02:29:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:39,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680264926] [2022-03-20 02:29:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680264926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:39,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:39,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401748585] [2022-03-20 02:29:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:39,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:39,254 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:39,444 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-03-20 02:29:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:29:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-03-20 02:29:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:39,445 INFO L225 Difference]: With dead ends: 141 [2022-03-20 02:29:39,445 INFO L226 Difference]: Without dead ends: 134 [2022-03-20 02:29:39,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:39,446 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 163 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:39,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 170 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-20 02:29:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-03-20 02:29:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 02:29:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-03-20 02:29:39,454 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-03-20 02:29:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:39,454 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-03-20 02:29:39,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:29:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-03-20 02:29:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:29:39,455 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:39,455 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:39,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 02:29:39,455 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-03-20 02:29:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089703012] [2022-03-20 02:29:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089703012] [2022-03-20 02:29:39,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089703012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:39,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:39,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270942533] [2022-03-20 02:29:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:39,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:39,632 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:39,784 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-03-20 02:29:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-03-20 02:29:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:39,786 INFO L225 Difference]: With dead ends: 144 [2022-03-20 02:29:39,786 INFO L226 Difference]: Without dead ends: 133 [2022-03-20 02:29:39,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:39,786 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:39,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 267 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-20 02:29:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-03-20 02:29:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-20 02:29:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-03-20 02:29:39,794 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-03-20 02:29:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:39,794 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-03-20 02:29:39,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:29:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-03-20 02:29:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-20 02:29:39,795 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:39,795 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:39,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 02:29:39,795 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:39,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-03-20 02:29:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36263344] [2022-03-20 02:29:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 02:29:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:29:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 02:29:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36263344] [2022-03-20 02:29:39,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36263344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:39,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:39,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371966208] [2022-03-20 02:29:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:39,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:39,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:39,946 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 02:29:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:40,091 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-03-20 02:29:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:40,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-03-20 02:29:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:40,092 INFO L225 Difference]: With dead ends: 133 [2022-03-20 02:29:40,092 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 02:29:40,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:40,093 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:40,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 134 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 02:29:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 02:29:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 02:29:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 02:29:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 02:29:40,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-03-20 02:29:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:40,093 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 02:29:40,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 02:29:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 02:29:40,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 02:29:40,096 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 02:29:40,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 02:29:40,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 02:29:42,124 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 515 522) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 515 522) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 02:29:42,125 INFO L878 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 565 575) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 565 575) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 37 50) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 37 50) no Hoare annotation was computed. [2022-03-20 02:29:42,125 INFO L882 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 51 72) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 51 72) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 288 422) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L878 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point L359(line 359) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L878 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L878 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 288 422) no Hoare annotation was computed. [2022-03-20 02:29:42,126 INFO L882 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L337(lines 323 368) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L321-1(lines 297 421) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L878 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2022-03-20 02:29:42,127 INFO L882 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L445-1(lines 445 448) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (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)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L446-1(line 446) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L882 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,128 INFO L878 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L431-1(lines 423 436) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 423 436) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 523 564) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 523 564) no Hoare annotation was computed. [2022-03-20 02:29:42,129 INFO L878 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 02:29:42,129 INFO L882 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L509-1(lines 501 514) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 501 514) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-03-20 02:29:42,130 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L878 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-03-20 02:29:42,130 INFO L882 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse4 (= ~setEventCalled~0 1)) (.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse6 (<= 259 KbFilter_PnP_~status~0)) (.cse10 (<= 5 ~MPR1~0)) (.cse11 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse2 (not .cse11)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse10)) (.cse8 (and .cse4 .cse10 .cse5 .cse11 (not .cse0) .cse12 .cse6 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse6 (= ~MPR3~0 ~s~0)) .cse7 .cse8 .cse9) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse7 .cse8 .cse9)))) [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L194-1(lines 194 196) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 75 287) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L878 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-03-20 02:29:42,131 INFO L882 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 75 287) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L885 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L882 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-03-20 02:29:42,132 INFO L878 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,133 INFO L882 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-03-20 02:29:42,133 INFO L882 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-03-20 02:29:42,133 INFO L882 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-03-20 02:29:42,133 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-03-20 02:29:42,133 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-03-20 02:29:42,133 INFO L882 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-03-20 02:29:42,135 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:42,136 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 02:29:42,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 02:29:42 BoogieIcfgContainer [2022-03-20 02:29:42,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 02:29:42,158 INFO L158 Benchmark]: Toolchain (without parser) took 10123.48ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 155.7MB in the beginning and 146.0MB in the end (delta: 9.7MB). Peak memory consumption was 153.0MB. Max. memory is 8.0GB. [2022-03-20 02:29:42,159 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 02:29:42,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.43ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 152.0MB in the end (delta: 3.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-03-20 02:29:42,159 INFO L158 Benchmark]: Boogie Preprocessor took 35.20ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 149.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-20 02:29:42,159 INFO L158 Benchmark]: RCFGBuilder took 416.81ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 126.9MB in the end (delta: 22.8MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-20 02:29:42,159 INFO L158 Benchmark]: TraceAbstraction took 9404.33ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 126.3MB in the beginning and 146.0MB in the end (delta: -19.7MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. [2022-03-20 02:29:42,160 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.10ms. Allocated memory is still 182.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.43ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 152.0MB in the end (delta: 3.5MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.20ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 149.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 416.81ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 126.9MB in the end (delta: 22.8MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9404.33ms. Allocated memory was 182.5MB in the beginning and 263.2MB in the end (delta: 80.7MB). Free memory was 126.3MB in the beginning and 146.0MB in the end (delta: -19.7MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3250 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3242 mSDsluCounter, 4409 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2398 mSDsCounter, 939 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4322 IncrementalHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 939 mSolverCounterUnsat, 2011 mSDtfsCounter, 4322 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 282 PreInvPairs, 348 NumberOfFragments, 2218 HoareAnnotationTreeSize, 282 FomulaSimplifications, 138 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 3616 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 876 NumberOfCodeBlocks, 876 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 3814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || (returnVal2 <= 0 && MPR1 == s)) || (((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) RESULT: Ultimate proved your program to be correct! [2022-03-20 02:29:42,224 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...