/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:15:39,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:15:39,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:15:39,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:15:39,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:15:39,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:15:39,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:15:39,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:15:39,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:15:39,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:15:39,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:15:39,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:15:39,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:15:39,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:15:39,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:15:39,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:15:39,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:15:39,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:15:39,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:15:39,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:15:39,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:15:39,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:15:39,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:15:39,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:15:39,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:15:39,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:15:39,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:15:39,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:15:39,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:15:39,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:15:39,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:15:39,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:15:39,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:15:39,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:15:39,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:15:39,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:15:39,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:15:39,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:15:39,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:15:39,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:15:39,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:15:39,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:15:39,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:15:39,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:15:39,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:15:39,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:15:39,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:15:39,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:15:39,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:15:39,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:15:39,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:15:39,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:15:39,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:15:39,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:15:39,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:39,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:15:39,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:15:39,877 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:15:39,877 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-01-31 16:15:40,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:15:40,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:15:40,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:15:40,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:15:40,079 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:15:40,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-31 16:15:40,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fad7bc/6c1150444d4c496287f5a5a2829e9f67/FLAGf7b3909c1 [2022-01-31 16:15:40,501 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:15:40,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-31 16:15:40,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fad7bc/6c1150444d4c496287f5a5a2829e9f67/FLAGf7b3909c1 [2022-01-31 16:15:40,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fad7bc/6c1150444d4c496287f5a5a2829e9f67 [2022-01-31 16:15:40,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:15:40,873 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:15:40,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:40,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:15:40,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:15:40,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:40" (1/1) ... [2022-01-31 16:15:40,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f97ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:40, skipping insertion in model container [2022-01-31 16:15:40,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:40" (1/1) ... [2022-01-31 16:15:40,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:15:40,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:15:41,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-01-31 16:15:41,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:41,134 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:15:41,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-01-31 16:15:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:41,190 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:15:41,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41 WrapperNode [2022-01-31 16:15:41,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:41,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:15:41,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:15:41,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:15:41,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:15:41,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:15:41,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:15:41,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:15:41,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:41,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:15:41,258 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-01-31 16:15:41,276 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-01-31 16:15:41,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:15:41,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 16:15:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 16:15:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 16:15:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 16:15:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 16:15:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:15:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 16:15:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:15:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:15:41,395 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:15:41,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:15:41,492 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,598 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 16:15:41,598 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 16:15:41,604 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,645 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 16:15:41,645 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 16:15:41,720 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,739 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 16:15:41,739 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 16:15:41,744 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,835 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 16:15:41,835 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 16:15:41,838 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,861 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 16:15:41,861 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 16:15:41,865 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:41,888 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 16:15:41,888 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 16:15:41,915 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:15:41,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:15:41,924 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 16:15:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:41 BoogieIcfgContainer [2022-01-31 16:15:41,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:15:41,926 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:15:41,927 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:15:41,928 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:15:41,931 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:41" (1/1) ... [2022-01-31 16:15:41,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:41 BasicIcfg [2022-01-31 16:15:41,966 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:15:41,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:15:41,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:15:41,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:15:41,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:15:40" (1/4) ... [2022-01-31 16:15:41,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:41, skipping insertion in model container [2022-01-31 16:15:41,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:41" (2/4) ... [2022-01-31 16:15:41,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:41, skipping insertion in model container [2022-01-31 16:15:41,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:41" (3/4) ... [2022-01-31 16:15:41,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:41, skipping insertion in model container [2022-01-31 16:15:41,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:41" (4/4) ... [2022-01-31 16:15:41,973 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.cJordan [2022-01-31 16:15:41,976 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:15:41,977 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:15:42,015 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:15:42,022 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 16:15:42,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:15:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 200 states have internal predecessors, (284), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-01-31 16:15:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 16:15:42,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:42,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:42,053 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -596457689, now seen corresponding path program 1 times [2022-01-31 16:15:42,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:42,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409082154] [2022-01-31 16:15:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:42,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:42,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:42,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409082154] [2022-01-31 16:15:42,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409082154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:42,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:42,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:15:42,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669321467] [2022-01-31 16:15:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:42,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:15:42,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:42,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:15:42,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:42,414 INFO L87 Difference]: Start difference. First operand has 240 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 200 states have internal predecessors, (284), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) 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-01-31 16:15:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:42,970 INFO L93 Difference]: Finished difference Result 268 states and 385 transitions. [2022-01-31 16:15:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:15:42,972 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-01-31 16:15:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:42,980 INFO L225 Difference]: With dead ends: 268 [2022-01-31 16:15:42,980 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 16:15:42,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:42,983 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 328 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:42,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 444 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 16:15:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2022-01-31 16:15:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4943181818181819) internal successors, (263), 192 states have internal predecessors, (263), 39 states have call successors, (39), 17 states have call predecessors, (39), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-31 16:15:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2022-01-31 16:15:43,023 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2022-01-31 16:15:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:43,023 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2022-01-31 16:15:43,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 16:15:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2022-01-31 16:15:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 16:15:43,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:43,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:43,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:15:43,025 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1037432085, now seen corresponding path program 1 times [2022-01-31 16:15:43,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:43,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646546663] [2022-01-31 16:15:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:43,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:43,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646546663] [2022-01-31 16:15:43,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646546663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:43,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:43,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:43,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233022607] [2022-01-31 16:15:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:43,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:43,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:43,154 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:43,727 INFO L93 Difference]: Finished difference Result 350 states and 478 transitions. [2022-01-31 16:15:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-31 16:15:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:43,730 INFO L225 Difference]: With dead ends: 350 [2022-01-31 16:15:43,730 INFO L226 Difference]: Without dead ends: 349 [2022-01-31 16:15:43,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:43,731 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 535 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:43,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 497 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-01-31 16:15:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2022-01-31 16:15:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 239 states have (on average 1.393305439330544) internal successors, (333), 243 states have internal predecessors, (333), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-01-31 16:15:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2022-01-31 16:15:43,749 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2022-01-31 16:15:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:43,749 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2022-01-31 16:15:43,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2022-01-31 16:15:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 16:15:43,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:43,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:43,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:15:43,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1384464757, now seen corresponding path program 1 times [2022-01-31 16:15:43,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:43,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440369113] [2022-01-31 16:15:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:43,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:43,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:43,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440369113] [2022-01-31 16:15:43,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440369113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:43,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:43,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:43,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407711600] [2022-01-31 16:15:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:43,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:43,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:43,914 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:44,417 INFO L93 Difference]: Finished difference Result 368 states and 494 transitions. [2022-01-31 16:15:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-31 16:15:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:44,419 INFO L225 Difference]: With dead ends: 368 [2022-01-31 16:15:44,419 INFO L226 Difference]: Without dead ends: 368 [2022-01-31 16:15:44,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:44,420 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 408 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:44,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 387 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-31 16:15:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2022-01-31 16:15:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 280 states have (on average 1.3857142857142857) internal successors, (388), 282 states have internal predecessors, (388), 34 states have call successors, (34), 23 states have call predecessors, (34), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-01-31 16:15:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2022-01-31 16:15:44,433 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2022-01-31 16:15:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:44,433 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2022-01-31 16:15:44,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2022-01-31 16:15:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 16:15:44,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:44,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:44,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:15:44,435 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 445761920, now seen corresponding path program 1 times [2022-01-31 16:15:44,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:44,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895858136] [2022-01-31 16:15:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:44,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:44,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:44,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895858136] [2022-01-31 16:15:44,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895858136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:44,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:44,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:44,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90988059] [2022-01-31 16:15:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:44,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:44,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:44,543 INFO L87 Difference]: Start difference. First operand 344 states and 466 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:44,910 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2022-01-31 16:15:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:44,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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-31 16:15:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:44,913 INFO L225 Difference]: With dead ends: 343 [2022-01-31 16:15:44,913 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 16:15:44,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:15:44,914 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 497 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:44,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 392 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:15:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 16:15:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-01-31 16:15:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 280 states have (on average 1.3785714285714286) internal successors, (386), 281 states have internal predecessors, (386), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-01-31 16:15:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2022-01-31 16:15:44,923 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2022-01-31 16:15:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:44,923 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2022-01-31 16:15:44,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2022-01-31 16:15:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:15:44,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:44,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:44,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:15:44,926 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1662306322, now seen corresponding path program 1 times [2022-01-31 16:15:44,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:44,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496948178] [2022-01-31 16:15:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:44,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:45,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496948178] [2022-01-31 16:15:45,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496948178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:45,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:45,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:45,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426136008] [2022-01-31 16:15:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:45,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:45,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:45,078 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:45,658 INFO L93 Difference]: Finished difference Result 325 states and 431 transitions. [2022-01-31 16:15:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 16:15:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:45,660 INFO L225 Difference]: With dead ends: 325 [2022-01-31 16:15:45,660 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 16:15:45,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:45,661 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 458 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:45,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 535 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 16:15:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2022-01-31 16:15:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 246 states have (on average 1.3699186991869918) internal successors, (337), 247 states have internal predecessors, (337), 30 states have call successors, (30), 21 states have call predecessors, (30), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-01-31 16:15:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2022-01-31 16:15:45,670 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2022-01-31 16:15:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:45,670 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2022-01-31 16:15:45,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2022-01-31 16:15:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 16:15:45,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:45,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:45,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:15:45,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1931812075, now seen corresponding path program 1 times [2022-01-31 16:15:45,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:45,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138682105] [2022-01-31 16:15:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:45,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:45,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138682105] [2022-01-31 16:15:45,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138682105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:45,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:45,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:45,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716773475] [2022-01-31 16:15:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:45,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:45,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:45,873 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:46,769 INFO L93 Difference]: Finished difference Result 326 states and 430 transitions. [2022-01-31 16:15:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-01-31 16:15:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:46,771 INFO L225 Difference]: With dead ends: 326 [2022-01-31 16:15:46,771 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 16:15:46,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:46,772 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 653 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:46,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 673 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:15:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 16:15:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 16:15:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 260 states have (on average 1.3615384615384616) internal successors, (354), 260 states have internal predecessors, (354), 30 states have call successors, (30), 21 states have call predecessors, (30), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-01-31 16:15:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 425 transitions. [2022-01-31 16:15:46,780 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 425 transitions. Word has length 45 [2022-01-31 16:15:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:46,780 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 425 transitions. [2022-01-31 16:15:46,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 425 transitions. [2022-01-31 16:15:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:15:46,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:46,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:46,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:15:46,782 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -273230455, now seen corresponding path program 1 times [2022-01-31 16:15:46,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586360145] [2022-01-31 16:15:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:46,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:46,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:46,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586360145] [2022-01-31 16:15:46,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586360145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:46,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:46,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:46,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937040113] [2022-01-31 16:15:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:46,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:46,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:46,995 INFO L87 Difference]: Start difference. First operand 320 states and 425 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:47,726 INFO L93 Difference]: Finished difference Result 325 states and 428 transitions. [2022-01-31 16:15:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-01-31 16:15:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,729 INFO L225 Difference]: With dead ends: 325 [2022-01-31 16:15:47,729 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 16:15:47,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:47,731 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 523 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 511 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 16:15:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 16:15:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 260 states have (on average 1.3576923076923078) internal successors, (353), 260 states have internal predecessors, (353), 30 states have call successors, (30), 21 states have call predecessors, (30), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-01-31 16:15:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 424 transitions. [2022-01-31 16:15:47,745 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 424 transitions. Word has length 46 [2022-01-31 16:15:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:47,745 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 424 transitions. [2022-01-31 16:15:47,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 424 transitions. [2022-01-31 16:15:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:15:47,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:47,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:47,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:15:47,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 98239540, now seen corresponding path program 1 times [2022-01-31 16:15:47,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:47,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936205163] [2022-01-31 16:15:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:47,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:47,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936205163] [2022-01-31 16:15:47,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936205163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:47,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:47,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:47,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380768976] [2022-01-31 16:15:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:47,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:47,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:47,881 INFO L87 Difference]: Start difference. First operand 320 states and 424 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,249 INFO L93 Difference]: Finished difference Result 314 states and 412 transitions. [2022-01-31 16:15:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-01-31 16:15:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,252 INFO L225 Difference]: With dead ends: 314 [2022-01-31 16:15:48,253 INFO L226 Difference]: Without dead ends: 272 [2022-01-31 16:15:48,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:48,255 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 436 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 407 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:15:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-31 16:15:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2022-01-31 16:15:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 198 states have (on average 1.378787878787879) internal successors, (273), 201 states have internal predecessors, (273), 27 states have call successors, (27), 19 states have call predecessors, (27), 16 states have return successors, (21), 21 states have call predecessors, (21), 20 states have call successors, (21) [2022-01-31 16:15:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2022-01-31 16:15:48,264 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 47 [2022-01-31 16:15:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,266 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2022-01-31 16:15:48,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2022-01-31 16:15:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:48,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:48,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:15:48,268 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1466269870, now seen corresponding path program 1 times [2022-01-31 16:15:48,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123913905] [2022-01-31 16:15:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 16:15:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:48,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123913905] [2022-01-31 16:15:48,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123913905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:48,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145709471] [2022-01-31 16:15:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:48,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:48,415 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,810 INFO L93 Difference]: Finished difference Result 240 states and 317 transitions. [2022-01-31 16:15:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-01-31 16:15:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,812 INFO L225 Difference]: With dead ends: 240 [2022-01-31 16:15:48,812 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 16:15:48,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:48,814 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 629 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 461 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:15:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 16:15:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-01-31 16:15:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 199 states have internal predecessors, (270), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (21), 21 states have call predecessors, (21), 20 states have call successors, (21) [2022-01-31 16:15:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2022-01-31 16:15:48,819 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2022-01-31 16:15:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,819 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2022-01-31 16:15:48,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2022-01-31 16:15:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:48,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:48,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:15:48,820 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash -614114349, now seen corresponding path program 1 times [2022-01-31 16:15:48,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322589710] [2022-01-31 16:15:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:48,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322589710] [2022-01-31 16:15:48,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322589710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:48,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499565201] [2022-01-31 16:15:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:48,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:48,966 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:49,728 INFO L93 Difference]: Finished difference Result 243 states and 317 transitions. [2022-01-31 16:15:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:15:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 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 51 [2022-01-31 16:15:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:49,729 INFO L225 Difference]: With dead ends: 243 [2022-01-31 16:15:49,730 INFO L226 Difference]: Without dead ends: 243 [2022-01-31 16:15:49,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:49,730 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 509 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:49,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 594 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-31 16:15:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2022-01-31 16:15:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 199 states have internal predecessors, (268), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (21), 21 states have call predecessors, (21), 20 states have call successors, (21) [2022-01-31 16:15:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 315 transitions. [2022-01-31 16:15:49,735 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 315 transitions. Word has length 51 [2022-01-31 16:15:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:49,735 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 315 transitions. [2022-01-31 16:15:49,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 315 transitions. [2022-01-31 16:15:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:49,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:49,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:49,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:15:49,736 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 412861826, now seen corresponding path program 1 times [2022-01-31 16:15:49,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:49,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306133316] [2022-01-31 16:15:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:49,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:49,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306133316] [2022-01-31 16:15:49,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306133316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:49,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:49,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:49,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131378370] [2022-01-31 16:15:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:49,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:49,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:49,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:49,885 INFO L87 Difference]: Start difference. First operand 240 states and 315 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:50,422 INFO L93 Difference]: Finished difference Result 253 states and 329 transitions. [2022-01-31 16:15:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2022-01-31 16:15:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:50,424 INFO L225 Difference]: With dead ends: 253 [2022-01-31 16:15:50,424 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 16:15:50,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:15:50,425 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 803 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:50,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 531 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 16:15:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-01-31 16:15:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 200 states have (on average 1.36) internal successors, (272), 202 states have internal predecessors, (272), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (21), 21 states have call predecessors, (21), 20 states have call successors, (21) [2022-01-31 16:15:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-01-31 16:15:50,429 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 53 [2022-01-31 16:15:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:50,430 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-01-31 16:15:50,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-01-31 16:15:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:50,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:50,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:50,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:15:50,431 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash -584210527, now seen corresponding path program 1 times [2022-01-31 16:15:50,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271040743] [2022-01-31 16:15:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:50,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:50,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271040743] [2022-01-31 16:15:50,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271040743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:50,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:50,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:50,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101728930] [2022-01-31 16:15:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:50,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:50,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:50,584 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:51,354 INFO L93 Difference]: Finished difference Result 240 states and 311 transitions. [2022-01-31 16:15:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (7), 6 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 53 [2022-01-31 16:15:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:51,355 INFO L225 Difference]: With dead ends: 240 [2022-01-31 16:15:51,355 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 16:15:51,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:51,356 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 678 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:51,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [679 Valid, 612 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 16:15:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-01-31 16:15:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.3435897435897435) internal successors, (262), 197 states have internal predecessors, (262), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (21), 21 states have call predecessors, (21), 20 states have call successors, (21) [2022-01-31 16:15:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2022-01-31 16:15:51,360 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 53 [2022-01-31 16:15:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:51,360 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2022-01-31 16:15:51,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:15:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2022-01-31 16:15:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:51,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:51,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:51,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:15:51,361 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1869212545, now seen corresponding path program 1 times [2022-01-31 16:15:51,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:51,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803146191] [2022-01-31 16:15:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:51,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:51,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803146191] [2022-01-31 16:15:51,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803146191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:51,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:51,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:51,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194559019] [2022-01-31 16:15:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:51,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:51,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:51,505 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:52,019 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2022-01-31 16:15:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:52,019 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), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-01-31 16:15:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:52,020 INFO L225 Difference]: With dead ends: 247 [2022-01-31 16:15:52,020 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 16:15:52,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:52,021 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 291 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:52,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 879 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 16:15:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-01-31 16:15:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 171 states have (on average 1.345029239766082) internal successors, (230), 173 states have internal predecessors, (230), 24 states have call successors, (24), 17 states have call predecessors, (24), 14 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2022-01-31 16:15:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2022-01-31 16:15:52,025 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 53 [2022-01-31 16:15:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:52,025 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2022-01-31 16:15:52,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2022-01-31 16:15:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:15:52,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:52,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:52,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:15:52,026 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 518044277, now seen corresponding path program 1 times [2022-01-31 16:15:52,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:52,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558187320] [2022-01-31 16:15:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:52,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:52,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558187320] [2022-01-31 16:15:52,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558187320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:52,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:52,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:52,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693568804] [2022-01-31 16:15:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:52,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:52,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:52,186 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:52,679 INFO L93 Difference]: Finished difference Result 234 states and 302 transitions. [2022-01-31 16:15:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-01-31 16:15:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:52,681 INFO L225 Difference]: With dead ends: 234 [2022-01-31 16:15:52,681 INFO L226 Difference]: Without dead ends: 227 [2022-01-31 16:15:52,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:52,681 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 279 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:52,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 690 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-31 16:15:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2022-01-31 16:15:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.3371428571428572) internal successors, (234), 177 states have internal predecessors, (234), 24 states have call successors, (24), 17 states have call predecessors, (24), 15 states have return successors, (20), 20 states have call predecessors, (20), 18 states have call successors, (20) [2022-01-31 16:15:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2022-01-31 16:15:52,685 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 57 [2022-01-31 16:15:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:52,686 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2022-01-31 16:15:52,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2022-01-31 16:15:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:15:52,686 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:52,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:52,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:15:52,687 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash -175143961, now seen corresponding path program 1 times [2022-01-31 16:15:52,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:52,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579993688] [2022-01-31 16:15:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:52,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:52,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:52,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579993688] [2022-01-31 16:15:52,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579993688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:52,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:52,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:52,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311124466] [2022-01-31 16:15:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:52,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:52,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:52,829 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:53,397 INFO L93 Difference]: Finished difference Result 228 states and 295 transitions. [2022-01-31 16:15:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:15:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-01-31 16:15:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:53,398 INFO L225 Difference]: With dead ends: 228 [2022-01-31 16:15:53,398 INFO L226 Difference]: Without dead ends: 228 [2022-01-31 16:15:53,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:53,399 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 328 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:53,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 679 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-01-31 16:15:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 216. [2022-01-31 16:15:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 178 states have internal predecessors, (235), 24 states have call successors, (24), 17 states have call predecessors, (24), 15 states have return successors, (20), 20 states have call predecessors, (20), 18 states have call successors, (20) [2022-01-31 16:15:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-01-31 16:15:53,403 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 57 [2022-01-31 16:15:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:53,403 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-01-31 16:15:53,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-01-31 16:15:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 16:15:53,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:53,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:53,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:15:53,404 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 100170340, now seen corresponding path program 1 times [2022-01-31 16:15:53,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:53,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773228641] [2022-01-31 16:15:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:53,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:53,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:53,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773228641] [2022-01-31 16:15:53,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773228641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:53,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:53,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:15:53,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576084616] [2022-01-31 16:15:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:53,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:15:53,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:15:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:53,561 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:54,190 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2022-01-31 16:15:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2022-01-31 16:15:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:54,192 INFO L225 Difference]: With dead ends: 229 [2022-01-31 16:15:54,192 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 16:15:54,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:54,192 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 365 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:54,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 897 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 16:15:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-01-31 16:15:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 174 states have internal predecessors, (230), 23 states have call successors, (23), 17 states have call predecessors, (23), 15 states have return successors, (19), 19 states have call predecessors, (19), 17 states have call successors, (19) [2022-01-31 16:15:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-01-31 16:15:54,197 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 54 [2022-01-31 16:15:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:54,197 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-01-31 16:15:54,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-01-31 16:15:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:15:54,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:54,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:54,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:15:54,198 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash -827563874, now seen corresponding path program 1 times [2022-01-31 16:15:54,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:54,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887811647] [2022-01-31 16:15:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:54,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:54,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887811647] [2022-01-31 16:15:54,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887811647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:54,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:54,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:54,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844610] [2022-01-31 16:15:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:54,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:54,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:54,404 INFO L87 Difference]: Start difference. First operand 211 states and 272 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:55,023 INFO L93 Difference]: Finished difference Result 220 states and 281 transitions. [2022-01-31 16:15:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2022-01-31 16:15:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:55,024 INFO L225 Difference]: With dead ends: 220 [2022-01-31 16:15:55,025 INFO L226 Difference]: Without dead ends: 209 [2022-01-31 16:15:55,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:55,025 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 475 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:55,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 916 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-31 16:15:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-01-31 16:15:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 173 states have internal predecessors, (228), 22 states have call successors, (22), 17 states have call predecessors, (22), 15 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2022-01-31 16:15:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2022-01-31 16:15:55,030 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 56 [2022-01-31 16:15:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:55,030 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2022-01-31 16:15:55,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2022-01-31 16:15:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:55,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:55,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:55,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:15:55,031 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 332957832, now seen corresponding path program 1 times [2022-01-31 16:15:55,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099771412] [2022-01-31 16:15:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:55,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:55,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099771412] [2022-01-31 16:15:55,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099771412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:55,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:55,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:55,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701714417] [2022-01-31 16:15:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:55,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:55,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:55,154 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:55,428 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2022-01-31 16:15:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 16:15:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:55,429 INFO L225 Difference]: With dead ends: 222 [2022-01-31 16:15:55,429 INFO L226 Difference]: Without dead ends: 220 [2022-01-31 16:15:55,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:55,430 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 396 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:55,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 362 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 16:15:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-01-31 16:15:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 211. [2022-01-31 16:15:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.323699421965318) internal successors, (229), 175 states have internal predecessors, (229), 22 states have call successors, (22), 17 states have call predecessors, (22), 15 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2022-01-31 16:15:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2022-01-31 16:15:55,434 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 58 [2022-01-31 16:15:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:55,434 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2022-01-31 16:15:55,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2022-01-31 16:15:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:55,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:55,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:55,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:15:55,435 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -360230406, now seen corresponding path program 1 times [2022-01-31 16:15:55,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:55,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540483154] [2022-01-31 16:15:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:55,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:55,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:55,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540483154] [2022-01-31 16:15:55,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540483154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:55,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:55,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:55,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110766416] [2022-01-31 16:15:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:55,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:55,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:55,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:55,570 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:55,955 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-01-31 16:15:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:55,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 16:15:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:55,956 INFO L225 Difference]: With dead ends: 205 [2022-01-31 16:15:55,956 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 16:15:55,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:55,957 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 269 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:55,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 584 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 16:15:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-01-31 16:15:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.3173652694610778) internal successors, (220), 169 states have internal predecessors, (220), 22 states have call successors, (22), 17 states have call predecessors, (22), 15 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2022-01-31 16:15:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 260 transitions. [2022-01-31 16:15:55,960 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 260 transitions. Word has length 58 [2022-01-31 16:15:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:55,960 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 260 transitions. [2022-01-31 16:15:55,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-01-31 16:15:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:15:55,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:55,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:55,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:15:55,961 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1803908003, now seen corresponding path program 1 times [2022-01-31 16:15:55,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:55,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485657561] [2022-01-31 16:15:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:55,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 16:15:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:56,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:56,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485657561] [2022-01-31 16:15:56,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485657561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:56,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:56,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:56,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835041655] [2022-01-31 16:15:56,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:56,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:56,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:56,158 INFO L87 Difference]: Start difference. First operand 205 states and 260 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:56,890 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2022-01-31 16:15:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:15:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-01-31 16:15:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:56,891 INFO L225 Difference]: With dead ends: 259 [2022-01-31 16:15:56,891 INFO L226 Difference]: Without dead ends: 245 [2022-01-31 16:15:56,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:56,892 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 503 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:56,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 620 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-31 16:15:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 211. [2022-01-31 16:15:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.308139534883721) internal successors, (225), 175 states have internal predecessors, (225), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2022-01-31 16:15:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 267 transitions. [2022-01-31 16:15:56,896 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 267 transitions. Word has length 55 [2022-01-31 16:15:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:56,896 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 267 transitions. [2022-01-31 16:15:56,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 267 transitions. [2022-01-31 16:15:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:15:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:56,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:56,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:15:56,897 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1648306559, now seen corresponding path program 1 times [2022-01-31 16:15:56,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073538993] [2022-01-31 16:15:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:56,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 16:15:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:57,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:57,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073538993] [2022-01-31 16:15:57,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073538993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:57,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:57,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:15:57,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994696103] [2022-01-31 16:15:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:57,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:15:57,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:15:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:57,082 INFO L87 Difference]: Start difference. First operand 211 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:57,712 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2022-01-31 16:15:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:57,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-01-31 16:15:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:57,713 INFO L225 Difference]: With dead ends: 224 [2022-01-31 16:15:57,713 INFO L226 Difference]: Without dead ends: 189 [2022-01-31 16:15:57,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:57,714 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 359 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:57,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 815 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-01-31 16:15:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-01-31 16:15:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 151 states have (on average 1.2251655629139073) internal successors, (185), 154 states have internal predecessors, (185), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (18), 17 states have call predecessors, (18), 15 states have call successors, (18) [2022-01-31 16:15:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 224 transitions. [2022-01-31 16:15:57,717 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 224 transitions. Word has length 55 [2022-01-31 16:15:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:57,717 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 224 transitions. [2022-01-31 16:15:57,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:15:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 224 transitions. [2022-01-31 16:15:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:15:57,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:57,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:57,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:15:57,718 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash 908198158, now seen corresponding path program 1 times [2022-01-31 16:15:57,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:57,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302737804] [2022-01-31 16:15:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:57,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:57,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:57,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302737804] [2022-01-31 16:15:57,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302737804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:57,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:57,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:57,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024397165] [2022-01-31 16:15:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:57,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:57,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:57,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:57,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:57,841 INFO L87 Difference]: Start difference. First operand 189 states and 224 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:58,030 INFO L93 Difference]: Finished difference Result 190 states and 224 transitions. [2022-01-31 16:15:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 16:15:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:58,032 INFO L225 Difference]: With dead ends: 190 [2022-01-31 16:15:58,032 INFO L226 Difference]: Without dead ends: 188 [2022-01-31 16:15:58,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:58,033 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 245 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:58,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 313 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-31 16:15:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-01-31 16:15:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.2) internal successors, (180), 153 states have internal predecessors, (180), 21 states have call successors, (21), 17 states have call predecessors, (21), 16 states have return successors, (18), 17 states have call predecessors, (18), 15 states have call successors, (18) [2022-01-31 16:15:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2022-01-31 16:15:58,036 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 60 [2022-01-31 16:15:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:58,036 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2022-01-31 16:15:58,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2022-01-31 16:15:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 16:15:58,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:58,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:58,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:15:58,037 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1169621802, now seen corresponding path program 1 times [2022-01-31 16:15:58,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:58,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871160676] [2022-01-31 16:15:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:58,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:58,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871160676] [2022-01-31 16:15:58,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871160676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:58,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:58,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:58,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827851200] [2022-01-31 16:15:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:58,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:58,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:58,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:58,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:58,209 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:58,647 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2022-01-31 16:15:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-01-31 16:15:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:58,649 INFO L225 Difference]: With dead ends: 197 [2022-01-31 16:15:58,649 INFO L226 Difference]: Without dead ends: 162 [2022-01-31 16:15:58,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:58,649 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 157 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:58,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 859 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-31 16:15:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-01-31 16:15:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 130 states have internal predecessors, (146), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2022-01-31 16:15:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2022-01-31 16:15:58,653 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 61 [2022-01-31 16:15:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:58,653 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2022-01-31 16:15:58,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2022-01-31 16:15:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:15:58,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:58,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:58,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:15:58,654 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1224252621, now seen corresponding path program 1 times [2022-01-31 16:15:58,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:58,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268929349] [2022-01-31 16:15:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:58,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:58,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268929349] [2022-01-31 16:15:58,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268929349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:58,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:58,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:58,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322322311] [2022-01-31 16:15:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:58,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:58,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:58,829 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:59,130 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2022-01-31 16:15:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-01-31 16:15:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:59,131 INFO L225 Difference]: With dead ends: 171 [2022-01-31 16:15:59,131 INFO L226 Difference]: Without dead ends: 136 [2022-01-31 16:15:59,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:59,132 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 102 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:59,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 714 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 16:15:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-31 16:15:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-01-31 16:15:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 109 states have internal predecessors, (121), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (12), 12 states have call predecessors, (12), 10 states have call successors, (12) [2022-01-31 16:15:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-01-31 16:15:59,134 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 57 [2022-01-31 16:15:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:59,134 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-01-31 16:15:59,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-01-31 16:15:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:15:59,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:59,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:59,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:15:59,135 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1667338316, now seen corresponding path program 1 times [2022-01-31 16:15:59,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:59,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560995107] [2022-01-31 16:15:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:59,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:15:59,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 16:15:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:15:59,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 16:15:59,196 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 16:15:59,196 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:15:59,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:15:59,200 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:59,204 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:15:59,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:59 BasicIcfg [2022-01-31 16:15:59,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:15:59,298 INFO L158 Benchmark]: Toolchain (without parser) took 18424.66ms. Allocated memory was 192.9MB in the beginning and 377.5MB in the end (delta: 184.5MB). Free memory was 138.8MB in the beginning and 236.3MB in the end (delta: -97.5MB). Peak memory consumption was 87.5MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,298 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:15:59,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.05ms. Allocated memory is still 192.9MB. Free memory was 138.6MB in the beginning and 157.5MB in the end (delta: -19.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,298 INFO L158 Benchmark]: Boogie Preprocessor took 41.42ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,298 INFO L158 Benchmark]: RCFGBuilder took 691.89ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 120.8MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,299 INFO L158 Benchmark]: IcfgTransformer took 40.40ms. Allocated memory is still 192.9MB. Free memory was 120.8MB in the beginning and 116.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,299 INFO L158 Benchmark]: TraceAbstraction took 17329.43ms. Allocated memory was 192.9MB in the beginning and 377.5MB in the end (delta: 184.5MB). Free memory was 116.1MB in the beginning and 236.3MB in the end (delta: -120.1MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2022-01-31 16:15:59,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.05ms. Allocated memory is still 192.9MB. Free memory was 138.6MB in the beginning and 157.5MB in the end (delta: -19.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.42ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 154.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.89ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 120.8MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * IcfgTransformer took 40.40ms. Allocated memory is still 192.9MB. Free memory was 120.8MB in the beginning and 116.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17329.43ms. Allocated memory was 192.9MB in the beginning and 377.5MB in the end (delta: 184.5MB). Free memory was 116.1MB in the beginning and 236.3MB in the end (delta: -120.1MB). Peak memory consumption was 65.5MB. 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 - CounterExampleResult [Line: 1013]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [\old(compFptr)=67, \old(compRegistered)=61, \old(customIrp)=53, \old(DC)=65, \old(DevicePowerState)=68, \old(Executive)=50, \old(IPC)=58, \old(KernelMode)=55, \old(lowerDriverReturn)=49, \old(MPR1)=60, \old(MPR3)=69, \old(myStatus)=64, \old(NP)=51, \old(pended)=54, \old(s)=56, \old(setEventCalled)=52, \old(SKIP1)=57, \old(SKIP2)=62, \old(UNLOADED)=66, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, devobj=0, Executive=0, IPC=0, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=-2, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, UNLOADED=0] [L326] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=-5, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=-2, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L248] status = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=-4, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=-4, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=-2, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KbFilter_PnP(devobj, pirp)=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=3, UNLOADED=0] [L453] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10246 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10226 mSDsluCounter, 14372 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8772 mSDsCounter, 1963 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17970 IncrementalHoareTripleChecker+Invalid, 19933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1963 mSolverCounterUnsat, 5600 mSDtfsCounter, 17970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=3, InterpolantAutomatonStates: 251, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 240 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 5754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-31 16:15:59,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...