/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:55:46,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:55:46,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:55:46,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:55:46,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:55:46,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:55:46,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:55:46,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:55:46,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:55:46,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:55:46,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:55:46,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:55:46,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:55:46,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:55:46,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:55:46,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:55:46,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:55:46,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:55:46,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:55:46,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:55:46,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:55:46,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:55:46,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:55:46,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:55:46,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:55:46,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:55:46,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:55:46,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:55:46,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:55:46,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:55:46,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:55:46,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:55:46,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:55:46,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:55:46,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:55:46,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:55:46,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:55:46,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:55:46,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:55:46,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:55:46,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:55:46,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:55:46,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:55:46,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:55:46,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:55:46,492 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:55:46,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:55:46,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:55:46,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:55:46,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:55:46,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:55:46,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:55:46,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:55:46,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:55:46,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:46,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:55:46,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:55:46,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:55:46,495 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:55:46,495 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 21:55:46,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:55:46,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:55:46,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:55:46,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:55:46,693 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:55:46,694 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 21:55:46,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe62ac9/ae9bd33e0c164f678159584f22d5535c/FLAG33fbdf055 [2022-01-31 21:55:47,127 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:55:47,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-31 21:55:47,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe62ac9/ae9bd33e0c164f678159584f22d5535c/FLAG33fbdf055 [2022-01-31 21:55:47,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afe62ac9/ae9bd33e0c164f678159584f22d5535c [2022-01-31 21:55:47,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:55:47,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:55:47,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:47,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:55:47,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:55:47,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7100368c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47, skipping insertion in model container [2022-01-31 21:55:47,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:55:47,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:55:47,457 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 21:55:47,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:47,468 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:55:47,532 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 21:55:47,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:47,546 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:55:47,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47 WrapperNode [2022-01-31 21:55:47,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:47,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:55:47,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:55:47,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:55:47,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:55:47,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:55:47,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:55:47,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:55:47,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (1/1) ... [2022-01-31 21:55:47,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:55:47,649 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 21:55:47,664 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 21:55:47,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:55:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:55:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:55:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 21:55:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 21:55:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 21:55:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 21:55:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 21:55:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 21:55:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 21:55:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 21:55:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 21:55:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 21:55:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 21:55:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 21:55:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:55:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:55:47,771 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:55:47,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:55:47,891 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,990 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 21:55:47,990 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 21:55:47,996 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:48,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 21:55:48,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 21:55:48,103 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:48,120 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 21:55:48,120 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 21:55:48,126 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:48,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 21:55:48,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 21:55:48,215 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:48,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 21:55:48,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 21:55:48,236 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:48,253 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 21:55:48,254 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 21:55:48,282 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:55:48,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:55:48,291 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 21:55:48,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:48 BoogieIcfgContainer [2022-01-31 21:55:48,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:55:48,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:55:48,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:55:48,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:55:48,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:55:47" (1/3) ... [2022-01-31 21:55:48,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de1ed91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:48, skipping insertion in model container [2022-01-31 21:55:48,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:47" (2/3) ... [2022-01-31 21:55:48,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de1ed91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:48, skipping insertion in model container [2022-01-31 21:55:48,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:48" (3/3) ... [2022-01-31 21:55:48,299 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-01-31 21:55:48,302 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:55:48,302 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:55:48,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:55:48,342 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=JORDAN [2022-01-31 21:55:48,342 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:55:48,359 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 21:55:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:55:48,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:48,367 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 21:55:48,368 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1235546278, now seen corresponding path program 1 times [2022-01-31 21:55:48,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:48,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [859933750] [2022-01-31 21:55:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:48,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:48,425 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:48,722 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 21:55:48,723 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:48,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [859933750] [2022-01-31 21:55:48,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [859933750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:48,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:48,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:55:48,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466318564] [2022-01-31 21:55:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:48,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:55:48,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:55:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:55:48,756 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 21:55:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:49,373 INFO L93 Difference]: Finished difference Result 417 states and 628 transitions. [2022-01-31 21:55:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:55:49,376 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 21:55:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:49,388 INFO L225 Difference]: With dead ends: 417 [2022-01-31 21:55:49,389 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 21:55:49,395 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 21:55:49,398 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 21:55:49,399 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 21:55:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 21:55:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2022-01-31 21:55:49,469 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 21:55:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2022-01-31 21:55:49,472 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2022-01-31 21:55:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:49,472 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2022-01-31 21:55:49,472 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 21:55:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2022-01-31 21:55:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:55:49,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:49,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] [2022-01-31 21:55:49,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:55:49,473 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:49,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -225403307, now seen corresponding path program 1 times [2022-01-31 21:55:49,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:49,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761504971] [2022-01-31 21:55:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:49,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:49,476 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,604 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 21:55:49,604 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761504971] [2022-01-31 21:55:49,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [761504971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:49,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:49,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:49,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407343169] [2022-01-31 21:55:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:49,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:49,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:49,606 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 21:55:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:50,309 INFO L93 Difference]: Finished difference Result 410 states and 565 transitions. [2022-01-31 21:55:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:50,310 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 21:55:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:50,312 INFO L225 Difference]: With dead ends: 410 [2022-01-31 21:55:50,312 INFO L226 Difference]: Without dead ends: 349 [2022-01-31 21:55:50,313 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 21:55:50,313 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 386 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:50,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 470 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-01-31 21:55:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2022-01-31 21:55:50,344 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 21:55:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2022-01-31 21:55:50,345 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2022-01-31 21:55:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:50,346 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2022-01-31 21:55:50,346 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 21:55:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2022-01-31 21:55:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:55:50,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:50,347 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 21:55:50,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:55:50,347 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash -809602478, now seen corresponding path program 1 times [2022-01-31 21:55:50,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:50,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526451913] [2022-01-31 21:55:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:50,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:50,350 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,445 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 21:55:50,445 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:50,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526451913] [2022-01-31 21:55:50,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1526451913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:50,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:50,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:50,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150389734] [2022-01-31 21:55:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:50,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:50,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:50,447 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 21:55:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:50,851 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2022-01-31 21:55:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:50,851 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 21:55:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:50,853 INFO L225 Difference]: With dead ends: 487 [2022-01-31 21:55:50,853 INFO L226 Difference]: Without dead ends: 368 [2022-01-31 21:55:50,854 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 21:55:50,854 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 410 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 21:55:50,855 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 21:55:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-31 21:55:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2022-01-31 21:55:50,900 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 21:55:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2022-01-31 21:55:50,901 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2022-01-31 21:55:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:50,902 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2022-01-31 21:55:50,902 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 21:55:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2022-01-31 21:55:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:55:50,903 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:50,903 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 21:55:50,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:55:50,904 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1415760533, now seen corresponding path program 1 times [2022-01-31 21:55:50,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:50,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391663651] [2022-01-31 21:55:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:50,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:50,906 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,006 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 21:55:51,006 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:51,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391663651] [2022-01-31 21:55:51,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [391663651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:51,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:51,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:51,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629617778] [2022-01-31 21:55:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:51,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:51,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:51,008 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 21:55:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:51,458 INFO L93 Difference]: Finished difference Result 347 states and 468 transitions. [2022-01-31 21:55:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:51,461 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 21:55:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:51,463 INFO L225 Difference]: With dead ends: 347 [2022-01-31 21:55:51,463 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 21:55:51,463 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 21:55:51,464 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 21:55:51,464 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 21:55:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 21:55:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-01-31 21:55:51,484 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 21:55:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2022-01-31 21:55:51,485 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2022-01-31 21:55:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:51,485 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2022-01-31 21:55:51,486 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 21:55:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2022-01-31 21:55:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:55:51,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:51,487 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 21:55:51,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:55:51,488 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash 605107567, now seen corresponding path program 1 times [2022-01-31 21:55:51,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:51,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242562235] [2022-01-31 21:55:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:51,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:51,490 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:55:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,599 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 21:55:51,599 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:51,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242562235] [2022-01-31 21:55:51,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [242562235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:51,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:51,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:51,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297718284] [2022-01-31 21:55:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:51,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:51,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:51,601 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 21:55:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:52,174 INFO L93 Difference]: Finished difference Result 394 states and 520 transitions. [2022-01-31 21:55:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:55:52,174 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 21:55:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:52,176 INFO L225 Difference]: With dead ends: 394 [2022-01-31 21:55:52,176 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 21:55:52,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:52,177 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:52,177 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.4s Time] [2022-01-31 21:55:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 21:55:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2022-01-31 21:55:52,196 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 21:55:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2022-01-31 21:55:52,197 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2022-01-31 21:55:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:52,197 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2022-01-31 21:55:52,197 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 21:55:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2022-01-31 21:55:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:55:52,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:52,199 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 21:55:52,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:55:52,199 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -447308474, now seen corresponding path program 1 times [2022-01-31 21:55:52,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:52,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241366821] [2022-01-31 21:55:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:52,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:52,201 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:55:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,402 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 21:55:52,403 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:52,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241366821] [2022-01-31 21:55:52,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [241366821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:52,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:52,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:52,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808031972] [2022-01-31 21:55:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:52,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:52,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:52,404 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 21:55:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:53,169 INFO L93 Difference]: Finished difference Result 334 states and 440 transitions. [2022-01-31 21:55:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:53,169 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 21:55:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:53,173 INFO L225 Difference]: With dead ends: 334 [2022-01-31 21:55:53,173 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 21:55:53,173 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 21:55:53,175 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1079 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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 21:55:53,177 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 21:55:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 21:55:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 21:55:53,206 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 21:55:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 425 transitions. [2022-01-31 21:55:53,208 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 425 transitions. Word has length 45 [2022-01-31 21:55:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:53,208 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 425 transitions. [2022-01-31 21:55:53,208 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 21:55:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 425 transitions. [2022-01-31 21:55:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:55:53,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:53,212 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 21:55:53,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:55:53,213 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1360970565, now seen corresponding path program 1 times [2022-01-31 21:55:53,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:53,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1299085649] [2022-01-31 21:55:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:53,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:53,215 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:55:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,438 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 21:55:53,438 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:53,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1299085649] [2022-01-31 21:55:53,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1299085649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:53,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:53,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:53,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83436329] [2022-01-31 21:55:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:53,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:53,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:53,440 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 21:55:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:54,235 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2022-01-31 21:55:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:54,235 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 21:55:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:54,237 INFO L225 Difference]: With dead ends: 330 [2022-01-31 21:55:54,237 INFO L226 Difference]: Without dead ends: 325 [2022-01-31 21:55:54,237 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 21:55:54,238 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 21:55:54,238 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 21:55:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-31 21:55:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-01-31 21:55:54,263 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 21:55:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 424 transitions. [2022-01-31 21:55:54,264 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 424 transitions. Word has length 46 [2022-01-31 21:55:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:54,265 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 424 transitions. [2022-01-31 21:55:54,265 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 21:55:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 424 transitions. [2022-01-31 21:55:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:55:54,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:54,266 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 21:55:54,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:55:54,266 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 548356508, now seen corresponding path program 1 times [2022-01-31 21:55:54,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:54,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004645924] [2022-01-31 21:55:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:54,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:54,268 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:55:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,364 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 21:55:54,364 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:54,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004645924] [2022-01-31 21:55:54,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2004645924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:54,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:54,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:54,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82742560] [2022-01-31 21:55:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:54,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:54,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:54,365 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 21:55:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:54,721 INFO L93 Difference]: Finished difference Result 338 states and 446 transitions. [2022-01-31 21:55:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:55:54,721 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 21:55:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:54,722 INFO L225 Difference]: With dead ends: 338 [2022-01-31 21:55:54,723 INFO L226 Difference]: Without dead ends: 272 [2022-01-31 21:55:54,723 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 21:55:54,723 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 21:55:54,723 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 21:55:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-31 21:55:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2022-01-31 21:55:54,744 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 21:55:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2022-01-31 21:55:54,745 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 47 [2022-01-31 21:55:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:54,746 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2022-01-31 21:55:54,746 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 21:55:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2022-01-31 21:55:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:55:54,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:54,747 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 21:55:54,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:55:54,747 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:54,747 INFO L85 PathProgramCache]: Analyzing trace with hash 916659597, now seen corresponding path program 1 times [2022-01-31 21:55:54,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:54,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994213236] [2022-01-31 21:55:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:54,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:54,749 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:55:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:55:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,876 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 21:55:54,876 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:54,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994213236] [2022-01-31 21:55:54,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1994213236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:54,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:54,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:54,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660278930] [2022-01-31 21:55:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:54,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:54,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:54,877 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 21:55:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:55,341 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2022-01-31 21:55:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:55:55,341 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 21:55:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:55,343 INFO L225 Difference]: With dead ends: 270 [2022-01-31 21:55:55,343 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 21:55:55,343 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 21:55:55,343 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 21:55:55,344 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 21:55:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 21:55:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-01-31 21:55:55,363 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 21:55:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2022-01-31 21:55:55,364 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2022-01-31 21:55:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:55,365 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2022-01-31 21:55:55,365 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 21:55:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2022-01-31 21:55:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:55:55,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:55,366 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 21:55:55,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:55:55,366 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1556296422, now seen corresponding path program 1 times [2022-01-31 21:55:55,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1951447328] [2022-01-31 21:55:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:55,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:55,368 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:55:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:55:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,499 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 21:55:55,499 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:55,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1951447328] [2022-01-31 21:55:55,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1951447328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:55,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:55,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:55:55,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832184416] [2022-01-31 21:55:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:55,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:55:55,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:55,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:55:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:55:55,501 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 21:55:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:56,178 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2022-01-31 21:55:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:55:56,179 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 21:55:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:56,180 INFO L225 Difference]: With dead ends: 284 [2022-01-31 21:55:56,180 INFO L226 Difference]: Without dead ends: 243 [2022-01-31 21:55:56,181 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 21:55:56,181 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 21:55:56,182 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 21:55:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-31 21:55:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2022-01-31 21:55:56,202 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 21:55:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 315 transitions. [2022-01-31 21:55:56,203 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 315 transitions. Word has length 51 [2022-01-31 21:55:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:56,203 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 315 transitions. [2022-01-31 21:55:56,203 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 21:55:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 315 transitions. [2022-01-31 21:55:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:55:56,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:56,204 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 21:55:56,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:55:56,204 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash 460482069, now seen corresponding path program 1 times [2022-01-31 21:55:56,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:56,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [526041701] [2022-01-31 21:55:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:56,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:56,206 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:55:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:55:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,341 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 21:55:56,341 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [526041701] [2022-01-31 21:55:56,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [526041701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:56,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:56,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:55:56,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409741919] [2022-01-31 21:55:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:56,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:55:56,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:55:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:56,343 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 21:55:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:56,998 INFO L93 Difference]: Finished difference Result 272 states and 349 transitions. [2022-01-31 21:55:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:56,998 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 21:55:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:56,999 INFO L225 Difference]: With dead ends: 272 [2022-01-31 21:55:56,999 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 21:55:57,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:55:57,000 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:57,001 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.5s Time] [2022-01-31 21:55:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 21:55:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-01-31 21:55:57,031 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 21:55:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-01-31 21:55:57,032 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 53 [2022-01-31 21:55:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:57,032 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-01-31 21:55:57,032 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 21:55:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-01-31 21:55:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:55:57,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:57,033 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 21:55:57,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:55:57,034 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1533662637, now seen corresponding path program 1 times [2022-01-31 21:55:57,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:57,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574668564] [2022-01-31 21:55:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:57,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:57,036 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:55:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:55:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,164 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 21:55:57,164 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [574668564] [2022-01-31 21:55:57,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [574668564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:57,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:57,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:57,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462252561] [2022-01-31 21:55:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:57,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:57,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:57,166 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 21:55:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:57,973 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2022-01-31 21:55:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:57,973 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 21:55:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:57,975 INFO L225 Difference]: With dead ends: 284 [2022-01-31 21:55:57,975 INFO L226 Difference]: Without dead ends: 240 [2022-01-31 21:55:57,975 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 21:55:57,975 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 21:55:57,976 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 21:55:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-01-31 21:55:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-01-31 21:55:58,013 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 21:55:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2022-01-31 21:55:58,014 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 53 [2022-01-31 21:55:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:58,014 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2022-01-31 21:55:58,014 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 21:55:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2022-01-31 21:55:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:55:58,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:58,015 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 21:55:58,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:55:58,016 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1386969835, now seen corresponding path program 1 times [2022-01-31 21:55:58,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [582937500] [2022-01-31 21:55:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:58,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:58,017 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:55:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:55:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:58,156 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [582937500] [2022-01-31 21:55:58,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [582937500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:58,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:58,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:58,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834563628] [2022-01-31 21:55:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:58,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:58,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:58,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:58,157 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 21:55:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:58,721 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2022-01-31 21:55:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:58,722 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 21:55:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:58,723 INFO L225 Difference]: With dead ends: 250 [2022-01-31 21:55:58,723 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 21:55:58,723 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 21:55:58,724 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 21:55:58,724 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 21:55:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 21:55:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-01-31 21:55:58,743 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 21:55:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2022-01-31 21:55:58,744 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 53 [2022-01-31 21:55:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:58,744 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2022-01-31 21:55:58,744 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 21:55:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2022-01-31 21:55:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:55:58,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:58,745 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 21:55:58,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:55:58,745 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -438914869, now seen corresponding path program 1 times [2022-01-31 21:55:58,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:58,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725123151] [2022-01-31 21:55:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:58,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:58,747 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:55:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,888 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 21:55:58,888 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:58,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725123151] [2022-01-31 21:55:58,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [725123151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:58,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:58,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:55:58,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021220617] [2022-01-31 21:55:58,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:58,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:55:58,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:55:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:55:58,889 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 21:55:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:59,462 INFO L93 Difference]: Finished difference Result 226 states and 289 transitions. [2022-01-31 21:55:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:55:59,462 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 21:55:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:59,466 INFO L225 Difference]: With dead ends: 226 [2022-01-31 21:55:59,466 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 21:55:59,467 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 21:55:59,467 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 21:55:59,467 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 21:55:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 21:55:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-01-31 21:55:59,487 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 21:55:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 266 transitions. [2022-01-31 21:55:59,487 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 266 transitions. Word has length 54 [2022-01-31 21:55:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:59,488 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 266 transitions. [2022-01-31 21:55:59,488 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 21:55:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 266 transitions. [2022-01-31 21:55:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:55:59,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:59,488 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 21:55:59,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:55:59,489 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 432963036, now seen corresponding path program 1 times [2022-01-31 21:55:59,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:59,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376081681] [2022-01-31 21:55:59,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:59,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:59,490 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:55:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:55:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,616 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 21:55:59,616 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:59,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376081681] [2022-01-31 21:55:59,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [376081681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:59,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:59,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:55:59,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001809023] [2022-01-31 21:55:59,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:59,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:55:59,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:55:59,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:55:59,617 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 21:56:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:00,100 INFO L93 Difference]: Finished difference Result 263 states and 337 transitions. [2022-01-31 21:56:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:00,100 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 21:56:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:00,101 INFO L225 Difference]: With dead ends: 263 [2022-01-31 21:56:00,102 INFO L226 Difference]: Without dead ends: 222 [2022-01-31 21:56:00,102 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 21:56:00,102 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 21:56:00,102 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 21:56:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-01-31 21:56:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2022-01-31 21:56:00,124 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 21:56:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2022-01-31 21:56:00,125 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 271 transitions. Word has length 57 [2022-01-31 21:56:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:00,125 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 271 transitions. [2022-01-31 21:56:00,125 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 21:56:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 271 transitions. [2022-01-31 21:56:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:56:00,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:00,126 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 21:56:00,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:56:00,126 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1039954733, now seen corresponding path program 1 times [2022-01-31 21:56:00,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:00,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399988111] [2022-01-31 21:56:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:00,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:00,127 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,270 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 21:56:00,271 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:00,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399988111] [2022-01-31 21:56:00,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1399988111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:00,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:00,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:00,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210307741] [2022-01-31 21:56:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:00,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:00,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:00,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:00,272 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 21:56:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:00,850 INFO L93 Difference]: Finished difference Result 230 states and 294 transitions. [2022-01-31 21:56:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:00,851 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 21:56:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:00,852 INFO L225 Difference]: With dead ends: 230 [2022-01-31 21:56:00,852 INFO L226 Difference]: Without dead ends: 223 [2022-01-31 21:56:00,852 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 21:56:00,853 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 21:56:00,853 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 21:56:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-31 21:56:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-01-31 21:56:00,874 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 21:56:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-01-31 21:56:00,875 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 57 [2022-01-31 21:56:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:00,875 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-01-31 21:56:00,875 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 21:56:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-01-31 21:56:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:56:00,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:00,876 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 21:56:00,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:56:00,876 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2132592656, now seen corresponding path program 1 times [2022-01-31 21:56:00,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:00,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298973988] [2022-01-31 21:56:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:00,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:00,878 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,051 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 21:56:01,051 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1298973988] [2022-01-31 21:56:01,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1298973988] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:01,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344723112] [2022-01-31 21:56:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:01,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:01,053 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 21:56:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:01,662 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2022-01-31 21:56:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:01,663 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 21:56:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:01,664 INFO L225 Difference]: With dead ends: 223 [2022-01-31 21:56:01,664 INFO L226 Difference]: Without dead ends: 209 [2022-01-31 21:56:01,664 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 21:56:01,664 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:01,665 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.6s Time] [2022-01-31 21:56:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-31 21:56:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-01-31 21:56:01,685 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 21:56:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2022-01-31 21:56:01,686 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 56 [2022-01-31 21:56:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:01,687 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2022-01-31 21:56:01,687 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 21:56:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2022-01-31 21:56:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:01,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:01,687 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 21:56:01,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:56:01,688 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1221590652, now seen corresponding path program 1 times [2022-01-31 21:56:01,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088590105] [2022-01-31 21:56:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:01,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:01,689 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 21:56:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,842 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 21:56:01,842 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088590105] [2022-01-31 21:56:01,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2088590105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:01,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383156971] [2022-01-31 21:56:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:01,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:01,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:01,843 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 21:56:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:02,567 INFO L93 Difference]: Finished difference Result 266 states and 329 transitions. [2022-01-31 21:56:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:02,568 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 21:56:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:02,569 INFO L225 Difference]: With dead ends: 266 [2022-01-31 21:56:02,569 INFO L226 Difference]: Without dead ends: 249 [2022-01-31 21:56:02,569 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 21:56:02,569 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 21:56:02,570 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 21:56:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-31 21:56:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 215. [2022-01-31 21:56:02,593 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 21:56:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2022-01-31 21:56:02,594 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 55 [2022-01-31 21:56:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:02,594 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2022-01-31 21:56:02,594 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 21:56:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2022-01-31 21:56:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:02,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:02,595 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 21:56:02,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:56:02,595 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2050869943, now seen corresponding path program 1 times [2022-01-31 21:56:02,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:02,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554335648] [2022-01-31 21:56:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:02,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:02,597 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 21:56:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,753 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 21:56:02,754 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:02,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554335648] [2022-01-31 21:56:02,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [554335648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:02,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:02,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:02,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30064165] [2022-01-31 21:56:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:02,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:02,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:02,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:02,755 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 21:56:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:03,328 INFO L93 Difference]: Finished difference Result 231 states and 291 transitions. [2022-01-31 21:56:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:03,329 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 21:56:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:03,330 INFO L225 Difference]: With dead ends: 231 [2022-01-31 21:56:03,330 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 21:56:03,330 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 21:56:03,330 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:03,331 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.5s Time] [2022-01-31 21:56:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 21:56:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-01-31 21:56:03,350 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 21:56:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2022-01-31 21:56:03,351 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 55 [2022-01-31 21:56:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:03,351 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2022-01-31 21:56:03,351 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 21:56:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2022-01-31 21:56:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:03,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:03,352 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 21:56:03,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:56:03,352 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1918234721, now seen corresponding path program 1 times [2022-01-31 21:56:03,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:03,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1368987272] [2022-01-31 21:56:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:03,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:03,353 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,500 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 21:56:03,500 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1368987272] [2022-01-31 21:56:03,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1368987272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:03,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:03,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:03,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444331209] [2022-01-31 21:56:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:03,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:03,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:03,501 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 21:56:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:03,845 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-01-31 21:56:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:03,845 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 21:56:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:03,846 INFO L225 Difference]: With dead ends: 229 [2022-01-31 21:56:03,846 INFO L226 Difference]: Without dead ends: 187 [2022-01-31 21:56:03,846 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 21:56:03,847 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 21:56:03,848 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 21:56:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-31 21:56:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-01-31 21:56:03,872 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 21:56:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2022-01-31 21:56:03,873 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 58 [2022-01-31 21:56:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:03,873 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2022-01-31 21:56:03,873 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 21:56:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-01-31 21:56:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:56:03,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:03,875 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 21:56:03,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:56:03,875 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1199488421, now seen corresponding path program 1 times [2022-01-31 21:56:03,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:03,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134954571] [2022-01-31 21:56:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:03,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:03,878 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:56:03,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 21:56:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:56:03,938 INFO L133 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-01-31 21:56:03,938 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 21:56:03,942 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:56:03,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:56:03,945 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 21:56:03,947 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:56:03,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:56:03 BoogieIcfgContainer [2022-01-31 21:56:03,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 21:56:03,973 INFO L158 Benchmark]: Toolchain (without parser) took 16816.70ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 142.2MB in the beginning and 179.5MB in the end (delta: -37.3MB). Peak memory consumption was 145.2MB. Max. memory is 8.0GB. [2022-01-31 21:56:03,973 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:56:03,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.19ms. Allocated memory is still 191.9MB. Free memory was 141.9MB in the beginning and 161.1MB in the end (delta: -19.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 21:56:03,974 INFO L158 Benchmark]: Boogie Preprocessor took 64.50ms. Allocated memory is still 191.9MB. Free memory was 161.1MB in the beginning and 158.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 21:56:03,974 INFO L158 Benchmark]: RCFGBuilder took 681.04ms. Allocated memory is still 191.9MB. Free memory was 158.5MB in the beginning and 124.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-31 21:56:03,976 INFO L158 Benchmark]: TraceAbstraction took 15678.40ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 124.4MB in the beginning and 179.5MB in the end (delta: -55.1MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. [2022-01-31 21:56:03,979 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.12ms. Allocated memory is still 191.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 386.19ms. Allocated memory is still 191.9MB. Free memory was 141.9MB in the beginning and 161.1MB in the end (delta: -19.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.50ms. Allocated memory is still 191.9MB. Free memory was 161.1MB in the beginning and 158.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 681.04ms. Allocated memory is still 191.9MB. Free memory was 158.5MB in the beginning and 124.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15678.40ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 124.4MB in the beginning and 179.5MB in the end (delta: -55.1MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9173 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9153 mSDsluCounter, 11722 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6850 mSDsCounter, 1761 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15215 IncrementalHoareTripleChecker+Invalid, 16976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1761 mSolverCounterUnsat, 4872 mSDtfsCounter, 15215 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 21:56:04,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...