/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:42:16,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:42:16,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:42:16,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:42:16,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:42:16,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:42:16,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:42:16,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:42:16,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:42:16,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:42:16,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:42:16,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:42:16,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:42:16,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:42:16,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:42:16,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:42:16,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:42:16,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:42:16,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:42:16,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:42:16,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:42:16,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:42:16,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:42:16,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:42:16,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:42:16,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:42:16,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:42:16,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:42:16,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:42:16,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:42:16,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:42:16,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:42:16,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:42:16,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:42:16,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:42:16,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:42:16,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:42:16,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:42:16,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:42:16,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:42:16,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:42:16,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:42:16,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:42:16,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:42:16,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:42:16,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:42:16,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:42:16,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:42:16,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:42:16,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:16,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:42:16,208 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 23:42:16,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:42:16,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:42:16,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:42:16,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:42:16,409 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:42:16,410 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 23:42:16,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d428d33/df509a75ffdb4dc6ada3e33ed7249a68/FLAG6bb3976bb [2022-01-31 23:42:16,874 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:42:16,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-31 23:42:16,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d428d33/df509a75ffdb4dc6ada3e33ed7249a68/FLAG6bb3976bb [2022-01-31 23:42:16,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d428d33/df509a75ffdb4dc6ada3e33ed7249a68 [2022-01-31 23:42:16,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:42:16,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:42:16,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:16,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:42:16,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:42:16,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:16" (1/1) ... [2022-01-31 23:42:16,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce091c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:16, skipping insertion in model container [2022-01-31 23:42:16,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:16" (1/1) ... [2022-01-31 23:42:16,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:42:16,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:42:17,142 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 23:42:17,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:17,149 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:42:17,202 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 23:42:17,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:17,212 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:42:17,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17 WrapperNode [2022-01-31 23:42:17,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:17,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:42:17,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:42:17,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:42:17,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:42:17,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:42:17,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:42:17,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:42:17,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (1/1) ... [2022-01-31 23:42:17,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:17,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:42:17,314 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 23:42:17,320 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 23:42:17,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 23:42:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 23:42:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 23:42:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 23:42:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 23:42:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 23:42:17,346 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 23:42:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:42:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:42:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:42:17,450 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:42:17,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:42:17,509 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,581 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 23:42:17,582 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 23:42:17,587 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,614 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:42:17,614 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:42:17,689 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,711 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 23:42:17,711 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 23:42:17,716 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,792 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 23:42:17,792 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 23:42:17,795 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,808 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 23:42:17,809 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 23:42:17,813 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,829 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:42:17,829 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:42:17,849 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:42:17,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:42:17,856 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 23:42:17,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:17 BoogieIcfgContainer [2022-01-31 23:42:17,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:42:17,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:42:17,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:42:17,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:42:17,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:42:16" (1/3) ... [2022-01-31 23:42:17,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b36607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:17, skipping insertion in model container [2022-01-31 23:42:17,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:17" (2/3) ... [2022-01-31 23:42:17,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b36607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:17, skipping insertion in model container [2022-01-31 23:42:17,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:17" (3/3) ... [2022-01-31 23:42:17,863 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-01-31 23:42:17,866 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:42:17,866 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:42:17,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:42:17,905 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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=QVASR [2022-01-31 23:42:17,905 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:42:17,928 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 23:42:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:42:17,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:17,935 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 23:42:17,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1235546278, now seen corresponding path program 1 times [2022-01-31 23:42:17,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:17,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404321248] [2022-01-31 23:42:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:17,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:17,986 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,183 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 23:42:18,184 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404321248] [2022-01-31 23:42:18,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [404321248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:18,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:18,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:42:18,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863515462] [2022-01-31 23:42:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:18,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:42:18,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:18,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:42:18,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:42:18,211 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 23:42:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:18,850 INFO L93 Difference]: Finished difference Result 417 states and 628 transitions. [2022-01-31 23:42:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 23:42:18,852 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 23:42:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:18,868 INFO L225 Difference]: With dead ends: 417 [2022-01-31 23:42:18,868 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 23:42:18,875 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 23:42:18,877 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 23:42:18,878 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 23:42:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 23:42:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2022-01-31 23:42:18,948 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 23:42:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2022-01-31 23:42:18,952 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2022-01-31 23:42:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:18,952 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2022-01-31 23:42:18,953 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 23:42:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2022-01-31 23:42:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 23:42:18,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:18,954 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 23:42:18,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:42:18,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash -225403307, now seen corresponding path program 1 times [2022-01-31 23:42:18,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:18,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391668416] [2022-01-31 23:42:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:18,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:18,971 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,168 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 23:42:19,169 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391668416] [2022-01-31 23:42:19,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [391668416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:19,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:19,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:19,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893706371] [2022-01-31 23:42:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:19,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:19,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:19,170 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 23:42:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:19,838 INFO L93 Difference]: Finished difference Result 410 states and 565 transitions. [2022-01-31 23:42:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:19,839 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 23:42:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:19,841 INFO L225 Difference]: With dead ends: 410 [2022-01-31 23:42:19,841 INFO L226 Difference]: Without dead ends: 349 [2022-01-31 23:42:19,842 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 23:42:19,842 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 386 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:19,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 476 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-01-31 23:42:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2022-01-31 23:42:19,870 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 23:42:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2022-01-31 23:42:19,871 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2022-01-31 23:42:19,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:19,872 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2022-01-31 23:42:19,872 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 23:42:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2022-01-31 23:42:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 23:42:19,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:19,873 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 23:42:19,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:42:19,873 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -809602478, now seen corresponding path program 1 times [2022-01-31 23:42:19,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:19,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113801630] [2022-01-31 23:42:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:19,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:19,875 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,967 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 23:42:19,968 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:19,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113801630] [2022-01-31 23:42:19,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2113801630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:19,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:19,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:19,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440556257] [2022-01-31 23:42:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:19,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:19,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:19,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:19,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:19,969 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 23:42:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:20,354 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2022-01-31 23:42:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:20,354 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 23:42:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:20,358 INFO L225 Difference]: With dead ends: 487 [2022-01-31 23:42:20,358 INFO L226 Difference]: Without dead ends: 368 [2022-01-31 23:42:20,358 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 23:42:20,362 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 410 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:20,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 366 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:42:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-31 23:42:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2022-01-31 23:42:20,386 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 23:42:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2022-01-31 23:42:20,388 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2022-01-31 23:42:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:20,388 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2022-01-31 23:42:20,388 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 23:42:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2022-01-31 23:42:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 23:42:20,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:20,390 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 23:42:20,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:42:20,390 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1415760533, now seen corresponding path program 1 times [2022-01-31 23:42:20,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:20,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381926631] [2022-01-31 23:42:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:20,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:20,392 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,493 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 23:42:20,493 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:20,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381926631] [2022-01-31 23:42:20,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [381926631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:20,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:20,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:20,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108066239] [2022-01-31 23:42:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:20,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:20,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:20,495 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 23:42:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:20,970 INFO L93 Difference]: Finished difference Result 347 states and 468 transitions. [2022-01-31 23:42:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:20,973 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 23:42:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:20,975 INFO L225 Difference]: With dead ends: 347 [2022-01-31 23:42:20,975 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 23:42:20,975 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 23:42:20,976 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 189 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:20,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 393 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 23:42:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-01-31 23:42:20,995 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 23:42:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2022-01-31 23:42:20,996 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2022-01-31 23:42:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:20,997 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2022-01-31 23:42:20,997 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 23:42:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2022-01-31 23:42:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 23:42:20,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:20,999 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 23:42:20,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:42:20,999 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 605107567, now seen corresponding path program 1 times [2022-01-31 23:42:20,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:20,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297645880] [2022-01-31 23:42:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:21,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:21,001 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,105 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 23:42:21,106 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:21,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297645880] [2022-01-31 23:42:21,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [297645880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:21,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:21,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:21,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253702012] [2022-01-31 23:42:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:21,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:21,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:21,107 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 23:42:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:21,775 INFO L93 Difference]: Finished difference Result 394 states and 520 transitions. [2022-01-31 23:42:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:21,776 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 23:42:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:21,777 INFO L225 Difference]: With dead ends: 394 [2022-01-31 23:42:21,777 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 23:42:21,778 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 23:42:21,778 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 603 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:21,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 583 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 23:42:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2022-01-31 23:42:21,797 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 23:42:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2022-01-31 23:42:21,799 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2022-01-31 23:42:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:21,799 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2022-01-31 23:42:21,799 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 23:42:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2022-01-31 23:42:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 23:42:21,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:21,801 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 23:42:21,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:42:21,801 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -447308474, now seen corresponding path program 1 times [2022-01-31 23:42:21,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:21,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862103307] [2022-01-31 23:42:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:21,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:21,803 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:42:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,999 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 23:42:21,999 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862103307] [2022-01-31 23:42:21,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [862103307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:21,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:21,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:21,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211721822] [2022-01-31 23:42:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:22,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:22,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:22,000 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 23:42:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:22,792 INFO L93 Difference]: Finished difference Result 334 states and 440 transitions. [2022-01-31 23:42:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:22,793 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 23:42:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:22,795 INFO L225 Difference]: With dead ends: 334 [2022-01-31 23:42:22,795 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 23:42:22,795 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 23:42:22,796 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1079 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:22,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1081 Valid, 500 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 23:42:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 23:42:22,828 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 23:42:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 425 transitions. [2022-01-31 23:42:22,829 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 425 transitions. Word has length 45 [2022-01-31 23:42:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:22,829 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 425 transitions. [2022-01-31 23:42:22,830 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 23:42:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 425 transitions. [2022-01-31 23:42:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 23:42:22,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:22,831 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 23:42:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:42:22,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1360970565, now seen corresponding path program 1 times [2022-01-31 23:42:22,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1551308876] [2022-01-31 23:42:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:22,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:22,833 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:42:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,001 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 23:42:23,001 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:23,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1551308876] [2022-01-31 23:42:23,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1551308876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:23,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:23,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:23,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203014108] [2022-01-31 23:42:23,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:23,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:23,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:23,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:23,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:23,003 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 23:42:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:23,745 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2022-01-31 23:42:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:23,748 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 23:42:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:23,750 INFO L225 Difference]: With dead ends: 330 [2022-01-31 23:42:23,750 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 23:42:23,750 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 23:42:23,752 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 783 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:23,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 423 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 23:42:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 23:42:23,794 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 23:42:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 424 transitions. [2022-01-31 23:42:23,795 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 424 transitions. Word has length 46 [2022-01-31 23:42:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:23,795 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 424 transitions. [2022-01-31 23:42:23,795 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 23:42:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 424 transitions. [2022-01-31 23:42:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 23:42:23,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:23,796 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 23:42:23,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:42:23,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 548356508, now seen corresponding path program 1 times [2022-01-31 23:42:23,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:23,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209525055] [2022-01-31 23:42:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:23,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:23,798 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:42:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,901 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 23:42:23,901 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:23,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209525055] [2022-01-31 23:42:23,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [209525055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:23,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:23,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:23,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647394043] [2022-01-31 23:42:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:23,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:23,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:23,903 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 23:42:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:24,251 INFO L93 Difference]: Finished difference Result 338 states and 446 transitions. [2022-01-31 23:42:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:42:24,251 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 23:42:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:24,253 INFO L225 Difference]: With dead ends: 338 [2022-01-31 23:42:24,253 INFO L226 Difference]: Without dead ends: 272 [2022-01-31 23:42:24,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 23:42:24,254 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 581 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:24,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 356 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:42:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-31 23:42:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2022-01-31 23:42:24,274 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 23:42:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2022-01-31 23:42:24,275 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 47 [2022-01-31 23:42:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:24,275 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2022-01-31 23:42:24,275 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 23:42:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2022-01-31 23:42:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:42:24,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:24,276 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 23:42:24,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:42:24,276 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 916659597, now seen corresponding path program 1 times [2022-01-31 23:42:24,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564846301] [2022-01-31 23:42:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:24,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:24,278 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 23:42:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 23:42:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,376 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 23:42:24,376 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:24,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564846301] [2022-01-31 23:42:24,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [564846301] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:24,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:24,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:24,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805426523] [2022-01-31 23:42:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:24,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:24,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:24,377 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 23:42:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:24,877 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2022-01-31 23:42:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:24,877 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 23:42:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:24,878 INFO L225 Difference]: With dead ends: 270 [2022-01-31 23:42:24,878 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 23:42:24,879 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 23:42:24,879 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 339 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:24,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 506 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 23:42:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-01-31 23:42:24,898 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 23:42:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2022-01-31 23:42:24,899 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2022-01-31 23:42:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:24,900 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2022-01-31 23:42:24,900 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 23:42:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2022-01-31 23:42:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 23:42:24,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:24,901 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 23:42:24,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:42:24,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1556296422, now seen corresponding path program 1 times [2022-01-31 23:42:24,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:24,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957518485] [2022-01-31 23:42:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:24,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:24,903 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:42:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:42:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:25,028 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:25,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957518485] [2022-01-31 23:42:25,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1957518485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:25,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:25,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:25,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923507558] [2022-01-31 23:42:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:25,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:25,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:25,029 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 23:42:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:25,665 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2022-01-31 23:42:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:42:25,665 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 23:42:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:25,667 INFO L225 Difference]: With dead ends: 284 [2022-01-31 23:42:25,667 INFO L226 Difference]: Without dead ends: 243 [2022-01-31 23:42:25,667 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 23:42:25,668 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 655 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:25,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 593 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-31 23:42:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2022-01-31 23:42:25,688 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 23:42:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 315 transitions. [2022-01-31 23:42:25,689 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 315 transitions. Word has length 51 [2022-01-31 23:42:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:25,689 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 315 transitions. [2022-01-31 23:42:25,689 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 23:42:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 315 transitions. [2022-01-31 23:42:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:42:25,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:25,690 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 23:42:25,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:42:25,690 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 460482069, now seen corresponding path program 1 times [2022-01-31 23:42:25,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:25,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948964422] [2022-01-31 23:42:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:25,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:25,692 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:42:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:42:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:25,830 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:25,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948964422] [2022-01-31 23:42:25,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [948964422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:25,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:25,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:25,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760798600] [2022-01-31 23:42:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:25,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:25,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:25,831 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 23:42:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:26,523 INFO L93 Difference]: Finished difference Result 272 states and 349 transitions. [2022-01-31 23:42:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:26,523 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 23:42:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:26,525 INFO L225 Difference]: With dead ends: 272 [2022-01-31 23:42:26,525 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 23:42:26,525 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 23:42:26,525 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 655 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:26,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 562 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 23:42:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-01-31 23:42:26,548 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 23:42:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-01-31 23:42:26,549 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 53 [2022-01-31 23:42:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:26,550 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-01-31 23:42:26,550 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 23:42:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-01-31 23:42:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:42:26,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:26,551 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 23:42:26,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:42:26,551 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1533662637, now seen corresponding path program 1 times [2022-01-31 23:42:26,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:26,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059869633] [2022-01-31 23:42:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:26,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:26,554 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:42:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:42:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,685 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 23:42:26,685 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059869633] [2022-01-31 23:42:26,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059869633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:26,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:26,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:26,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744049543] [2022-01-31 23:42:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:26,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:26,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:26,687 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 23:42:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:27,486 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2022-01-31 23:42:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:27,487 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 23:42:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:27,488 INFO L225 Difference]: With dead ends: 284 [2022-01-31 23:42:27,488 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 23:42:27,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:42:27,489 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 451 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:27,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 572 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 23:42:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-01-31 23:42:27,518 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 23:42:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2022-01-31 23:42:27,519 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 53 [2022-01-31 23:42:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:27,519 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2022-01-31 23:42:27,519 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 23:42:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2022-01-31 23:42:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:42:27,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:27,520 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 23:42:27,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:42:27,521 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1386969835, now seen corresponding path program 1 times [2022-01-31 23:42:27,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359148151] [2022-01-31 23:42:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:27,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:27,523 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:42:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:42:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,658 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 23:42:27,658 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:27,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359148151] [2022-01-31 23:42:27,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [359148151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:27,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:27,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:27,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546319092] [2022-01-31 23:42:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:27,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:27,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:27,659 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 23:42:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:28,217 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2022-01-31 23:42:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:28,217 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 23:42:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:28,218 INFO L225 Difference]: With dead ends: 250 [2022-01-31 23:42:28,218 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 23:42:28,219 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 23:42:28,219 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 433 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:28,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 905 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 23:42:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-01-31 23:42:28,238 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 23:42:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2022-01-31 23:42:28,238 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 53 [2022-01-31 23:42:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:28,239 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2022-01-31 23:42:28,239 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 23:42:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2022-01-31 23:42:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 23:42:28,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:28,240 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 23:42:28,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:42:28,240 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -438914869, now seen corresponding path program 1 times [2022-01-31 23:42:28,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:28,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166498156] [2022-01-31 23:42:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:28,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:28,241 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,393 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 23:42:28,393 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166498156] [2022-01-31 23:42:28,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166498156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:28,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:28,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:28,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256814767] [2022-01-31 23:42:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:28,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:28,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:28,395 INFO L87 Difference]: Start difference. First operand 210 states and 273 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 23:42:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:28,976 INFO L93 Difference]: Finished difference Result 226 states and 289 transitions. [2022-01-31 23:42:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:28,976 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 23:42:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:28,977 INFO L225 Difference]: With dead ends: 226 [2022-01-31 23:42:28,977 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 23:42:28,977 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 23:42:28,978 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 366 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:28,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 840 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 23:42:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-01-31 23:42:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.347305389221557) internal successors, (225), 169 states have internal predecessors, (225), 23 states have call successors, (23), 17 states have call predecessors, (23), 14 states have return successors, (18), 18 states have call predecessors, (18), 17 states have call successors, (18) [2022-01-31 23:42:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 266 transitions. [2022-01-31 23:42:28,998 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 266 transitions. Word has length 54 [2022-01-31 23:42:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:28,998 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 266 transitions. [2022-01-31 23:42:28,998 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 23:42:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 266 transitions. [2022-01-31 23:42:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 23:42:29,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:29,000 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 23:42:29,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:42:29,000 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 432963036, now seen corresponding path program 1 times [2022-01-31 23:42:29,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:29,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207382888] [2022-01-31 23:42:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:29,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:29,002 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,149 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 23:42:29,149 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:29,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207382888] [2022-01-31 23:42:29,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1207382888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:29,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:29,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:29,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867837502] [2022-01-31 23:42:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:29,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:29,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:29,151 INFO L87 Difference]: Start difference. First operand 205 states and 266 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 23:42:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:29,635 INFO L93 Difference]: Finished difference Result 263 states and 337 transitions. [2022-01-31 23:42:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:29,635 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 23:42:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:29,636 INFO L225 Difference]: With dead ends: 263 [2022-01-31 23:42:29,636 INFO L226 Difference]: Without dead ends: 222 [2022-01-31 23:42:29,637 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 23:42:29,637 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 273 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:29,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 671 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-01-31 23:42:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2022-01-31 23:42:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 173 states have internal predecessors, (229), 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 23:42:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2022-01-31 23:42:29,658 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 271 transitions. Word has length 57 [2022-01-31 23:42:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:29,658 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 271 transitions. [2022-01-31 23:42:29,659 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 23:42:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 271 transitions. [2022-01-31 23:42:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 23:42:29,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:29,659 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 23:42:29,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:42:29,660 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1039954733, now seen corresponding path program 1 times [2022-01-31 23:42:29,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:29,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1146776485] [2022-01-31 23:42:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:29,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:29,661 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,804 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 23:42:29,804 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1146776485] [2022-01-31 23:42:29,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1146776485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:29,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:29,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:29,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480690940] [2022-01-31 23:42:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:29,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:29,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:29,805 INFO L87 Difference]: Start difference. First operand 210 states and 271 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 23:42:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:30,390 INFO L93 Difference]: Finished difference Result 230 states and 294 transitions. [2022-01-31 23:42:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:42:30,391 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 23:42:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:30,392 INFO L225 Difference]: With dead ends: 230 [2022-01-31 23:42:30,392 INFO L226 Difference]: Without dead ends: 223 [2022-01-31 23:42:30,392 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 23:42:30,393 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 200 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:30,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 653 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:42:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-31 23:42:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-01-31 23:42:30,413 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 23:42:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-01-31 23:42:30,414 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 57 [2022-01-31 23:42:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:30,414 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-01-31 23:42:30,414 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 23:42:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-01-31 23:42:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 23:42:30,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:30,415 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 23:42:30,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:42:30,415 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2132592656, now seen corresponding path program 1 times [2022-01-31 23:42:30,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155962205] [2022-01-31 23:42:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:30,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:30,417 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 23:42:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,573 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 23:42:30,573 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:30,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155962205] [2022-01-31 23:42:30,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1155962205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:30,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:30,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:42:30,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194550219] [2022-01-31 23:42:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:30,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:42:30,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:42:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:42:30,575 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 23:42:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:31,158 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2022-01-31 23:42:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:31,158 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 23:42:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:31,159 INFO L225 Difference]: With dead ends: 223 [2022-01-31 23:42:31,159 INFO L226 Difference]: Without dead ends: 209 [2022-01-31 23:42:31,159 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 23:42:31,160 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 358 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:31,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 916 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-31 23:42:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-01-31 23:42:31,179 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 23:42:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2022-01-31 23:42:31,180 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 56 [2022-01-31 23:42:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:31,180 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2022-01-31 23:42:31,180 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 23:42:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2022-01-31 23:42:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 23:42:31,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:31,181 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 23:42:31,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:42:31,181 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1221590652, now seen corresponding path program 1 times [2022-01-31 23:42:31,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546757196] [2022-01-31 23:42:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:31,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:31,183 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 23:42:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,355 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 23:42:31,355 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:31,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546757196] [2022-01-31 23:42:31,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1546757196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:31,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:31,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:42:31,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456228375] [2022-01-31 23:42:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:31,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:42:31,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:31,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:42:31,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:31,356 INFO L87 Difference]: Start difference. First operand 209 states and 268 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 23:42:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:32,116 INFO L93 Difference]: Finished difference Result 266 states and 329 transitions. [2022-01-31 23:42:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:42:32,117 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 23:42:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:32,118 INFO L225 Difference]: With dead ends: 266 [2022-01-31 23:42:32,118 INFO L226 Difference]: Without dead ends: 249 [2022-01-31 23:42:32,118 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 23:42:32,118 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 629 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:32,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 612 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-31 23:42:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 215. [2022-01-31 23:42:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 179 states have internal predecessors, (233), 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 23:42:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2022-01-31 23:42:32,141 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 55 [2022-01-31 23:42:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:32,142 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2022-01-31 23:42:32,142 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 23:42:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2022-01-31 23:42:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 23:42:32,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:32,143 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 23:42:32,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:42:32,143 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2050869943, now seen corresponding path program 1 times [2022-01-31 23:42:32,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:32,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091921870] [2022-01-31 23:42:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:32,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:32,144 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 23:42:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,300 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 23:42:32,300 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:32,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091921870] [2022-01-31 23:42:32,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1091921870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:32,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:32,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:32,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375401278] [2022-01-31 23:42:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:32,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:32,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:32,301 INFO L87 Difference]: Start difference. First operand 215 states and 275 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 23:42:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:32,943 INFO L93 Difference]: Finished difference Result 231 states and 291 transitions. [2022-01-31 23:42:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:32,944 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 23:42:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:32,945 INFO L225 Difference]: With dead ends: 231 [2022-01-31 23:42:32,945 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 23:42:32,945 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 23:42:32,946 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 242 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:32,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 824 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 23:42:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-01-31 23:42:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 158 states have internal predecessors, (193), 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 23:42:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2022-01-31 23:42:32,967 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 55 [2022-01-31 23:42:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:32,967 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2022-01-31 23:42:32,967 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 23:42:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2022-01-31 23:42:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 23:42:32,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:32,968 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 23:42:32,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:42:32,968 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1918234721, now seen corresponding path program 1 times [2022-01-31 23:42:32,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:32,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314839799] [2022-01-31 23:42:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:32,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:32,971 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,105 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 23:42:33,105 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:33,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314839799] [2022-01-31 23:42:33,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [314839799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:33,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:33,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:33,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210020037] [2022-01-31 23:42:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:33,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:33,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:33,106 INFO L87 Difference]: Start difference. First operand 193 states and 232 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 23:42:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:33,446 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-01-31 23:42:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:33,447 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 23:42:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:33,448 INFO L225 Difference]: With dead ends: 229 [2022-01-31 23:42:33,448 INFO L226 Difference]: Without dead ends: 187 [2022-01-31 23:42:33,448 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 23:42:33,449 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 193 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:33,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 533 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:42:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-31 23:42:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-01-31 23:42:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 152 states have internal predecessors, (184), 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 23:42:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2022-01-31 23:42:33,472 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 58 [2022-01-31 23:42:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:33,472 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2022-01-31 23:42:33,472 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 23:42:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-01-31 23:42:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 23:42:33,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:33,473 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 23:42:33,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:42:33,474 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1199488421, now seen corresponding path program 1 times [2022-01-31 23:42:33,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301710156] [2022-01-31 23:42:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:33,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:33,475 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 23:42:33,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 23:42:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 23:42:33,530 INFO L133 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-01-31 23:42:33,530 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 23:42:33,535 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:42:33,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:42:33,538 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:33,540 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:42:33,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:42:33 BoogieIcfgContainer [2022-01-31 23:42:33,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:42:33,568 INFO L158 Benchmark]: Toolchain (without parser) took 16671.88ms. Allocated memory was 204.5MB in the beginning and 424.7MB in the end (delta: 220.2MB). Free memory was 151.0MB in the beginning and 323.8MB in the end (delta: -172.7MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2022-01-31 23:42:33,568 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 204.5MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:42:33,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.59ms. Allocated memory is still 204.5MB. Free memory was 150.8MB in the beginning and 171.1MB in the end (delta: -20.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-01-31 23:42:33,568 INFO L158 Benchmark]: Boogie Preprocessor took 52.58ms. Allocated memory is still 204.5MB. Free memory was 171.1MB in the beginning and 168.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 23:42:33,569 INFO L158 Benchmark]: RCFGBuilder took 591.37ms. Allocated memory is still 204.5MB. Free memory was 167.9MB in the beginning and 134.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-31 23:42:33,571 INFO L158 Benchmark]: TraceAbstraction took 15709.00ms. Allocated memory was 204.5MB in the beginning and 424.7MB in the end (delta: 220.2MB). Free memory was 134.0MB in the beginning and 323.8MB in the end (delta: -189.8MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2022-01-31 23:42:33,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 204.5MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.59ms. Allocated memory is still 204.5MB. Free memory was 150.8MB in the beginning and 171.1MB in the end (delta: -20.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.58ms. Allocated memory is still 204.5MB. Free memory was 171.1MB in the beginning and 168.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 591.37ms. Allocated memory is still 204.5MB. Free memory was 167.9MB in the beginning and 134.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15709.00ms. Allocated memory was 204.5MB in the beginning and 424.7MB in the end (delta: 220.2MB). Free memory was 134.0MB in the beginning and 323.8MB in the end (delta: -189.8MB). Peak memory consumption was 31.7MB. 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 ; [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 [L326] CALL _BLAST_init() [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 [L326] RET _BLAST_init() [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 [L337] COND FALSE !(irp_choice == 0) [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 [L342] RET stub_driver_init() [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 [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [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 [L106] COND FALSE !(irpStack__MinorFunction == 0) [L109] COND FALSE !(irpStack__MinorFunction == 23) [L112] COND TRUE irpStack__MinorFunction == 2 [L236] devExt__Removed = 1 [L237] COND TRUE s == NP [L238] s = SKIP1 [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; [L489] COND FALSE !(\read(compRegistered)) [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 [L518] returnVal2 = -1073741823 [L528] COND FALSE !(s == NP) [L532] COND FALSE !(s == MPR1) [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 [L551] return (returnVal2); [L247] RET IofCallDriver(devExt__TopOfStack, Irp) [L248] status = 0 [L290] return (status); [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) [L420] COND FALSE !(pended == 1) [L428] COND TRUE s != UNLOADED [L429] COND TRUE status != -1 [L430] COND FALSE !(s != SKIP2) [L440] COND FALSE !(pended == 1) [L447] COND FALSE !(s == DC) [L452] COND TRUE status != lowerDriverReturn [L453] CALL errorFn() [L1013] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9173 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9153 mSDsluCounter, 11728 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6852 mSDsCounter, 1761 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15221 IncrementalHoareTripleChecker+Invalid, 16982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1761 mSolverCounterUnsat, 4876 mSDtfsCounter, 15221 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=3, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 231 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 23:42:33,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...