/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/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:55:45,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:55:45,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:55:45,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:55:45,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:55:45,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:55:45,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:55:45,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:55:45,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:55:45,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:55:45,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:55:45,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:55:45,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:55:45,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:55:45,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:55:45,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:55:45,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:55:45,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:55:45,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:55:45,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:55:45,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:55:45,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:55:45,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:55:45,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:55:45,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:55:45,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:55:45,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:55:45,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:55:45,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:55:45,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:55:45,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:55:45,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:55:45,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:55:45,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:55:45,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:55:45,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:55:45,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:55:45,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:55:45,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:55:45,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:55:45,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:55:45,500 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:45,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:55:45,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:55:45,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:55:45,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:55:45,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:55:45,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:55:45,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:55:45,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:55:45,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:45,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:55:45,509 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:55:45,509 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:45,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:55:45,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:55:45,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:55:45,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:55:45,698 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:55:45,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 21:55:45,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383bc34fc/57e288a8094548afaea6f5312cc1f152/FLAG462d84958 [2022-01-31 21:55:46,146 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:55:46,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 21:55:46,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383bc34fc/57e288a8094548afaea6f5312cc1f152/FLAG462d84958 [2022-01-31 21:55:46,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383bc34fc/57e288a8094548afaea6f5312cc1f152 [2022-01-31 21:55:46,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:55:46,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:55:46,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:46,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:55:46,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:55:46,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54814db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46, skipping insertion in model container [2022-01-31 21:55:46,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:55:46,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:55:46,472 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/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 21:55:46,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:46,480 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:55:46,542 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/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 21:55:46,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:46,565 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:55:46,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46 WrapperNode [2022-01-31 21:55:46,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:46,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:55:46,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:55:46,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:55:46,575 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:46" (1/1) ... [2022-01-31 21:55:46,575 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:46" (1/1) ... [2022-01-31 21:55:46,597 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:46" (1/1) ... [2022-01-31 21:55:46,597 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:46" (1/1) ... [2022-01-31 21:55:46,613 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:46" (1/1) ... [2022-01-31 21:55:46,624 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:46" (1/1) ... [2022-01-31 21:55:46,626 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:46" (1/1) ... [2022-01-31 21:55:46,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:55:46,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:55:46,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:55:46,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:55:46,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:55:46,681 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:46,687 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:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-01-31 21:55:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 21:55:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-01-31 21:55:46,716 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 21:55:46,716 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-01-31 21:55:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 21:55:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-01-31 21:55:46,719 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:55:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:55:46,923 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:55:46,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:55:46,970 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,994 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:46,994 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:46,998 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,004 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,004 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,008 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,104 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 21:55:47,104 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 21:55:47,106 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,170 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-01-31 21:55:47,170 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-01-31 21:55:47,177 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,185 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 21:55:47,185 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 21:55:47,232 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,237 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,241 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,241 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,241 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,255 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,256 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,293 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,317 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 21:55:47,317 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 21:55:47,320 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,438 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-01-31 21:55:47,438 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-01-31 21:55:47,486 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,489 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,489 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,490 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,494 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,494 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,494 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,497 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,497 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,508 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:55:47,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:55:47,524 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 21:55:47,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:47 BoogieIcfgContainer [2022-01-31 21:55:47,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:55:47,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:55:47,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:55:47,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:55:47,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:55:46" (1/3) ... [2022-01-31 21:55:47,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d443244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:47, skipping insertion in model container [2022-01-31 21:55:47,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (2/3) ... [2022-01-31 21:55:47,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d443244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:47, skipping insertion in model container [2022-01-31 21:55:47,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:47" (3/3) ... [2022-01-31 21:55:47,535 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-01-31 21:55:47,539 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:55:47,539 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:55:47,569 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:55:47,574 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:47,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:55:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2022-01-31 21:55:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:55:47,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:47,599 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:47,599 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1386555085, now seen corresponding path program 1 times [2022-01-31 21:55:47,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:47,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265804568] [2022-01-31 21:55:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:47,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:47,653 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,962 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:47,963 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265804568] [2022-01-31 21:55:47,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [265804568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:47,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:47,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:55:47,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460111039] [2022-01-31 21:55:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:47,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:55:47,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:55:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:55:47,996 INFO L87 Difference]: Start difference. First operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) 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,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:49,052 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2022-01-31 21:55:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:55:49,054 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,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:49,063 INFO L225 Difference]: With dead ends: 666 [2022-01-31 21:55:49,063 INFO L226 Difference]: Without dead ends: 422 [2022-01-31 21:55:49,068 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,081 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:49,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-01-31 21:55:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-01-31 21:55:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-01-31 21:55:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-01-31 21:55:49,185 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-01-31 21:55:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-01-31 21:55:49,186 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,186 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-01-31 21:55:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:55:49,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:49,189 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] [2022-01-31 21:55:49,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:55:49,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1836211626, now seen corresponding path program 1 times [2022-01-31 21:55:49,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:49,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1255884322] [2022-01-31 21:55:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:49,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:49,195 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,386 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,386 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:49,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1255884322] [2022-01-31 21:55:49,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1255884322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:49,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:49,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:49,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306310108] [2022-01-31 21:55:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:49,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:49,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:49,390 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:50,753 INFO L93 Difference]: Finished difference Result 747 states and 1022 transitions. [2022-01-31 21:55:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:50,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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 25 [2022-01-31 21:55:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:50,758 INFO L225 Difference]: With dead ends: 747 [2022-01-31 21:55:50,758 INFO L226 Difference]: Without dead ends: 584 [2022-01-31 21:55:50,758 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,759 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 650 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:50,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 914 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:55:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-31 21:55:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-01-31 21:55:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2022-01-31 21:55:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-01-31 21:55:50,815 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-01-31 21:55:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:50,815 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-01-31 21:55:50,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 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,816 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-01-31 21:55:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:55:50,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:50,817 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] [2022-01-31 21:55:50,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:55:50,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1775067862, now seen corresponding path program 1 times [2022-01-31 21:55:50,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:50,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1257084331] [2022-01-31 21:55:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:50,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:50,820 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:50,974 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,974 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1257084331] [2022-01-31 21:55:50,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1257084331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:50,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:50,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:50,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378271483] [2022-01-31 21:55:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:50,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:50,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:50,976 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:51,995 INFO L93 Difference]: Finished difference Result 695 states and 934 transitions. [2022-01-31 21:55:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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 31 [2022-01-31 21:55:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:52,004 INFO L225 Difference]: With dead ends: 695 [2022-01-31 21:55:52,004 INFO L226 Difference]: Without dead ends: 676 [2022-01-31 21:55:52,010 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:52,016 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 758 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:52,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 604 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-31 21:55:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-01-31 21:55:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2022-01-31 21:55:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-01-31 21:55:52,069 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-01-31 21:55:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:52,070 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-01-31 21:55:52,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-01-31 21:55:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 21:55:52,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:52,071 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] [2022-01-31 21:55:52,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:55:52,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1405496584, now seen corresponding path program 1 times [2022-01-31 21:55:52,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918900779] [2022-01-31 21:55:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:52,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:52,075 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,191 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,191 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918900779] [2022-01-31 21:55:52,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1918900779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:52,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:52,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:52,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211418868] [2022-01-31 21:55:52,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:52,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:52,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:52,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:52,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:52,193 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:53,142 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2022-01-31 21:55:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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 33 [2022-01-31 21:55:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:53,146 INFO L225 Difference]: With dead ends: 1117 [2022-01-31 21:55:53,146 INFO L226 Difference]: Without dead ends: 819 [2022-01-31 21:55:53,147 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:53,148 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 832 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:53,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 761 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-01-31 21:55:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-01-31 21:55:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2022-01-31 21:55:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-01-31 21:55:53,203 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-01-31 21:55:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:53,203 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-01-31 21:55:53,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-01-31 21:55:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:55:53,205 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:53,205 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:53,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:55:53,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash -883255635, now seen corresponding path program 1 times [2022-01-31 21:55:53,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:53,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963220521] [2022-01-31 21:55:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:53,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:53,208 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,366 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,367 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963220521] [2022-01-31 21:55:53,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1963220521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:53,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:53,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:53,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780463976] [2022-01-31 21:55:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:53,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:53,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:53,368 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:54,359 INFO L93 Difference]: Finished difference Result 865 states and 1163 transitions. [2022-01-31 21:55:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:55:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2022-01-31 21:55:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:54,371 INFO L225 Difference]: With dead ends: 865 [2022-01-31 21:55:54,371 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 21:55:54,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:54,372 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 712 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:54,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 892 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 21:55:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-01-31 21:55:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 21:55:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-01-31 21:55:54,427 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-01-31 21:55:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:54,427 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-01-31 21:55:54,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-01-31 21:55:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 21:55:54,428 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:54,428 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:54,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:55:54,428 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 726893149, now seen corresponding path program 1 times [2022-01-31 21:55:54,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178443023] [2022-01-31 21:55:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:54,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:54,431 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,556 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,556 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:54,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178443023] [2022-01-31 21:55:54,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1178443023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:54,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:54,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:54,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839637788] [2022-01-31 21:55:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:54,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:54,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:54,558 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:55,530 INFO L93 Difference]: Finished difference Result 842 states and 1132 transitions. [2022-01-31 21:55:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-31 21:55:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:55,535 INFO L225 Difference]: With dead ends: 842 [2022-01-31 21:55:55,535 INFO L226 Difference]: Without dead ends: 839 [2022-01-31 21:55:55,536 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:55,538 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 320 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:55,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 720 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:55:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-01-31 21:55:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-01-31 21:55:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 21:55:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-01-31 21:55:55,599 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-01-31 21:55:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:55,599 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-01-31 21:55:55,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-01-31 21:55:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:55:55,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:55,602 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] [2022-01-31 21:55:55,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:55:55,602 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2055229827, now seen corresponding path program 1 times [2022-01-31 21:55:55,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:55,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327289953] [2022-01-31 21:55:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:55,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:55,605 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,835 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,835 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:55,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327289953] [2022-01-31 21:55:55,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1327289953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:55,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:55,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:55,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11231678] [2022-01-31 21:55:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:55,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:55,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:55,836 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:57,456 INFO L93 Difference]: Finished difference Result 877 states and 1176 transitions. [2022-01-31 21:55:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:55:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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 40 [2022-01-31 21:55:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:57,461 INFO L225 Difference]: With dead ends: 877 [2022-01-31 21:55:57,461 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 21:55:57,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:55:57,464 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1023 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:57,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 1188 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:55:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 21:55:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 21:55:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 21:55:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-01-31 21:55:57,541 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-01-31 21:55:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:57,541 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-01-31 21:55:57,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 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:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-01-31 21:55:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:55:57,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:57,544 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] [2022-01-31 21:55:57,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:55:57,544 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1573005165, now seen corresponding path program 1 times [2022-01-31 21:55:57,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:57,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608251734] [2022-01-31 21:55:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:57,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:57,547 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,712 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,712 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:57,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608251734] [2022-01-31 21:55:57,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1608251734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:57,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:57,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:57,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706173686] [2022-01-31 21:55:57,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:57,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:57,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:57,714 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:59,025 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2022-01-31 21:55:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:55:59,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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 41 [2022-01-31 21:55:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:59,028 INFO L225 Difference]: With dead ends: 877 [2022-01-31 21:55:59,028 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 21:55:59,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:55:59,029 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1279 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:59,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 928 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 21:55:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 21:55:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 21:55:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-01-31 21:55:59,116 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-01-31 21:55:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:59,116 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-01-31 21:55:59,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-01-31 21:55:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:55:59,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:59,118 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] [2022-01-31 21:55:59,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:55:59,118 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1434972884, now seen corresponding path program 1 times [2022-01-31 21:55:59,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356962284] [2022-01-31 21:55:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:59,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:59,121 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:55:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:55:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,252 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,252 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356962284] [2022-01-31 21:55:59,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [356962284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:59,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:59,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:55:59,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521522720] [2022-01-31 21:55:59,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:59,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:55:59,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:55:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:55:59,253 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:00,309 INFO L93 Difference]: Finished difference Result 882 states and 1180 transitions. [2022-01-31 21:56:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-01-31 21:56:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:00,321 INFO L225 Difference]: With dead ends: 882 [2022-01-31 21:56:00,322 INFO L226 Difference]: Without dead ends: 867 [2022-01-31 21:56:00,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:00,322 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 539 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:00,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 1451 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-01-31 21:56:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-01-31 21:56:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2022-01-31 21:56:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-01-31 21:56:00,391 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 42 [2022-01-31 21:56:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:00,391 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-01-31 21:56:00,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-01-31 21:56:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:56:00,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:00,392 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] [2022-01-31 21:56:00,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:56:00,392 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1612959141, now seen corresponding path program 1 times [2022-01-31 21:56:00,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031994508] [2022-01-31 21:56:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:00,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:00,395 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,542 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,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031994508] [2022-01-31 21:56:00,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2031994508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:00,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:00,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:00,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704849403] [2022-01-31 21:56:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:00,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:00,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:00,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:00,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:00,544 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:01,556 INFO L93 Difference]: Finished difference Result 880 states and 1176 transitions. [2022-01-31 21:56:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-01-31 21:56:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:01,560 INFO L225 Difference]: With dead ends: 880 [2022-01-31 21:56:01,560 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 21:56:01,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:01,561 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 734 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:01,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 1283 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 21:56:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-01-31 21:56:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 21:56:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-01-31 21:56:01,633 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 41 [2022-01-31 21:56:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:01,633 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-01-31 21:56:01,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-01-31 21:56:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:56:01,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:01,634 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] [2022-01-31 21:56:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:56:01,635 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2069240196, now seen corresponding path program 1 times [2022-01-31 21:56:01,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:01,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [977644940] [2022-01-31 21:56:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:01,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:01,637 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:01,710 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 6 [2022-01-31 21:56:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,793 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,794 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [977644940] [2022-01-31 21:56:01,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [977644940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:01,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475194927] [2022-01-31 21:56:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:01,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:01,795 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:03,038 INFO L93 Difference]: Finished difference Result 857 states and 1144 transitions. [2022-01-31 21:56:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-01-31 21:56:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:03,062 INFO L225 Difference]: With dead ends: 857 [2022-01-31 21:56:03,062 INFO L226 Difference]: Without dead ends: 835 [2022-01-31 21:56:03,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:03,062 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 235 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:03,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1014 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-01-31 21:56:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-01-31 21:56:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 21:56:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-01-31 21:56:03,133 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-01-31 21:56:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:03,133 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-01-31 21:56:03,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-01-31 21:56:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:56:03,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:03,134 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] [2022-01-31 21:56:03,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:56:03,135 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash -289846458, now seen corresponding path program 1 times [2022-01-31 21:56:03,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:03,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215185909] [2022-01-31 21:56:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:03,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:03,137 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,267 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,268 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:03,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215185909] [2022-01-31 21:56:03,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1215185909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:03,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:03,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:03,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780006044] [2022-01-31 21:56:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:03,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:03,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:03,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:03,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:03,269 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:04,426 INFO L93 Difference]: Finished difference Result 908 states and 1209 transitions. [2022-01-31 21:56:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-01-31 21:56:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:04,429 INFO L225 Difference]: With dead ends: 908 [2022-01-31 21:56:04,430 INFO L226 Difference]: Without dead ends: 840 [2022-01-31 21:56:04,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:04,430 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 616 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:04,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 931 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-31 21:56:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-01-31 21:56:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 21:56:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 21:56:04,503 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-01-31 21:56:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:04,503 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 21:56:04,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 21:56:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:56:04,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:04,504 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] [2022-01-31 21:56:04,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:56:04,504 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1666051445, now seen corresponding path program 1 times [2022-01-31 21:56:04,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:04,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719375038] [2022-01-31 21:56:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:04,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:04,506 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,632 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:04,633 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719375038] [2022-01-31 21:56:04,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [719375038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:04,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:04,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:04,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769956866] [2022-01-31 21:56:04,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:04,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:04,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:04,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:04,634 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:05,826 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2022-01-31 21:56:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-01-31 21:56:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:05,830 INFO L225 Difference]: With dead ends: 860 [2022-01-31 21:56:05,830 INFO L226 Difference]: Without dead ends: 838 [2022-01-31 21:56:05,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:05,831 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 293 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:05,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1010 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-01-31 21:56:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-01-31 21:56:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 21:56:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 21:56:05,906 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-01-31 21:56:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:05,906 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 21:56:05,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 21:56:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:56:05,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:05,907 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:56:05,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:56:05,907 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -233101078, now seen corresponding path program 1 times [2022-01-31 21:56:05,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928899669] [2022-01-31 21:56:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:05,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:05,910 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:06,071 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:06,072 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:06,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928899669] [2022-01-31 21:56:06,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1928899669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:06,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:06,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:06,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039545471] [2022-01-31 21:56:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:06,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:06,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:06,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:06,074 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:07,074 INFO L93 Difference]: Finished difference Result 861 states and 1149 transitions. [2022-01-31 21:56:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-01-31 21:56:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:07,077 INFO L225 Difference]: With dead ends: 861 [2022-01-31 21:56:07,077 INFO L226 Difference]: Without dead ends: 843 [2022-01-31 21:56:07,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:07,078 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 632 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:07,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 1326 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-01-31 21:56:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-01-31 21:56:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2022-01-31 21:56:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-01-31 21:56:07,167 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-01-31 21:56:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:07,167 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-01-31 21:56:07,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-01-31 21:56:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:56:07,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:07,168 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:56:07,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:56:07,168 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1086119000, now seen corresponding path program 1 times [2022-01-31 21:56:07,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:07,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794883992] [2022-01-31 21:56:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:07,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:07,170 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,308 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:07,308 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:07,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794883992] [2022-01-31 21:56:07,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1794883992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:07,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:07,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:07,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312070892] [2022-01-31 21:56:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:07,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:07,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:07,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:07,310 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:08,541 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2022-01-31 21:56:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-01-31 21:56:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:08,544 INFO L225 Difference]: With dead ends: 880 [2022-01-31 21:56:08,545 INFO L226 Difference]: Without dead ends: 804 [2022-01-31 21:56:08,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:08,545 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 336 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:08,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 900 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:56:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-01-31 21:56:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-01-31 21:56:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2022-01-31 21:56:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-01-31 21:56:08,627 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-01-31 21:56:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:08,627 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-01-31 21:56:08,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-01-31 21:56:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:56:08,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:08,632 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:56:08,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:56:08,632 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 380283320, now seen corresponding path program 1 times [2022-01-31 21:56:08,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222707484] [2022-01-31 21:56:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:08,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:08,635 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,752 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:08,752 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:08,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222707484] [2022-01-31 21:56:08,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [222707484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:08,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:08,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:08,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141322454] [2022-01-31 21:56:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:08,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:08,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:08,753 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:10,103 INFO L93 Difference]: Finished difference Result 1134 states and 1535 transitions. [2022-01-31 21:56:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-01-31 21:56:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:10,107 INFO L225 Difference]: With dead ends: 1134 [2022-01-31 21:56:10,107 INFO L226 Difference]: Without dead ends: 1131 [2022-01-31 21:56:10,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:10,108 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 429 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:10,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 784 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:56:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-01-31 21:56:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-01-31 21:56:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2022-01-31 21:56:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-01-31 21:56:10,234 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-01-31 21:56:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:10,235 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-01-31 21:56:10,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-01-31 21:56:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:56:10,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:10,236 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:56:10,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:56:10,236 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1845769478, now seen corresponding path program 1 times [2022-01-31 21:56:10,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:10,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269226219] [2022-01-31 21:56:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:10,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:10,239 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,363 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:10,363 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1269226219] [2022-01-31 21:56:10,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1269226219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:10,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:10,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:10,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511451906] [2022-01-31 21:56:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:10,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:10,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:10,365 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:11,371 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2022-01-31 21:56:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-01-31 21:56:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:11,375 INFO L225 Difference]: With dead ends: 933 [2022-01-31 21:56:11,375 INFO L226 Difference]: Without dead ends: 915 [2022-01-31 21:56:11,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:11,376 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 404 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:11,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1281 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-01-31 21:56:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-01-31 21:56:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 21:56:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-01-31 21:56:11,467 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-01-31 21:56:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:11,468 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-01-31 21:56:11,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-01-31 21:56:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:56:11,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:11,469 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] [2022-01-31 21:56:11,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:56:11,469 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1334176634, now seen corresponding path program 1 times [2022-01-31 21:56:11,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:11,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241136631] [2022-01-31 21:56:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:11,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:11,472 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 21:56:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,655 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:11,656 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:11,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241136631] [2022-01-31 21:56:11,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1241136631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:11,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:11,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:11,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968400831] [2022-01-31 21:56:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:11,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:11,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:11,657 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 21:56:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:13,105 INFO L93 Difference]: Finished difference Result 1483 states and 1950 transitions. [2022-01-31 21:56:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-01-31 21:56:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:13,110 INFO L225 Difference]: With dead ends: 1483 [2022-01-31 21:56:13,110 INFO L226 Difference]: Without dead ends: 936 [2022-01-31 21:56:13,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:13,112 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1791 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:13,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1803 Valid, 859 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-01-31 21:56:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-01-31 21:56:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 21:56:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-01-31 21:56:13,230 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-01-31 21:56:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:13,231 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-01-31 21:56:13,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 21:56:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-01-31 21:56:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:13,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:13,232 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] [2022-01-31 21:56:13,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:56:13,232 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -934618588, now seen corresponding path program 1 times [2022-01-31 21:56:13,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259475177] [2022-01-31 21:56:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:13,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:13,234 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,382 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:13,383 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:13,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259475177] [2022-01-31 21:56:13,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [259475177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:13,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:13,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:13,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963340456] [2022-01-31 21:56:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:13,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:13,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:13,384 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:15,190 INFO L93 Difference]: Finished difference Result 1151 states and 1528 transitions. [2022-01-31 21:56:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:56:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 21:56:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:15,194 INFO L225 Difference]: With dead ends: 1151 [2022-01-31 21:56:15,194 INFO L226 Difference]: Without dead ends: 1075 [2022-01-31 21:56:15,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:56:15,195 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 1331 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:15,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1334 Valid, 1405 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:56:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-01-31 21:56:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-01-31 21:56:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 21:56:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-01-31 21:56:15,319 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-01-31 21:56:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:15,320 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-01-31 21:56:15,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-01-31 21:56:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:15,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:15,321 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] [2022-01-31 21:56:15,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:56:15,321 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -550624226, now seen corresponding path program 1 times [2022-01-31 21:56:15,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579389585] [2022-01-31 21:56:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:15,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:15,323 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,460 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:15,460 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:15,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579389585] [2022-01-31 21:56:15,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [579389585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:15,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:15,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:15,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115741932] [2022-01-31 21:56:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:15,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:15,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:15,461 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:16,432 INFO L93 Difference]: Finished difference Result 979 states and 1296 transitions. [2022-01-31 21:56:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 21:56:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:16,436 INFO L225 Difference]: With dead ends: 979 [2022-01-31 21:56:16,436 INFO L226 Difference]: Without dead ends: 959 [2022-01-31 21:56:16,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:16,436 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 779 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:16,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 1355 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-01-31 21:56:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-01-31 21:56:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 21:56:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-01-31 21:56:16,542 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-01-31 21:56:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:16,543 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-01-31 21:56:16,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-01-31 21:56:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:16,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:16,544 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] [2022-01-31 21:56:16,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:56:16,544 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1358171884, now seen corresponding path program 1 times [2022-01-31 21:56:16,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339316298] [2022-01-31 21:56:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:16,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:16,546 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,649 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:16,649 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339316298] [2022-01-31 21:56:16,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [339316298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:16,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:16,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:16,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781397471] [2022-01-31 21:56:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:16,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:16,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:16,650 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:17,753 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2022-01-31 21:56:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 21:56:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:17,756 INFO L225 Difference]: With dead ends: 1041 [2022-01-31 21:56:17,756 INFO L226 Difference]: Without dead ends: 685 [2022-01-31 21:56:17,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:17,757 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 692 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:17,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 831 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-01-31 21:56:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-01-31 21:56:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 21:56:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-01-31 21:56:17,849 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-01-31 21:56:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:17,849 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-01-31 21:56:17,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-01-31 21:56:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:17,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:17,850 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:56:17,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:56:17,850 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1083541932, now seen corresponding path program 1 times [2022-01-31 21:56:17,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:17,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807070868] [2022-01-31 21:56:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:17,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:17,852 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:17,979 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:17,979 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:17,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807070868] [2022-01-31 21:56:17,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [807070868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:17,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:17,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:17,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882827160] [2022-01-31 21:56:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:17,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:17,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:17,980 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:19,229 INFO L93 Difference]: Finished difference Result 681 states and 860 transitions. [2022-01-31 21:56:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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 51 [2022-01-31 21:56:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:19,233 INFO L225 Difference]: With dead ends: 681 [2022-01-31 21:56:19,233 INFO L226 Difference]: Without dead ends: 659 [2022-01-31 21:56:19,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:56:19,233 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 782 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:19,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [798 Valid, 1006 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-01-31 21:56:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2022-01-31 21:56:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 21:56:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2022-01-31 21:56:19,316 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2022-01-31 21:56:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:19,316 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2022-01-31 21:56:19,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2022-01-31 21:56:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:19,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:19,317 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:56:19,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:56:19,317 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 325068325, now seen corresponding path program 1 times [2022-01-31 21:56:19,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:19,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334925029] [2022-01-31 21:56:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:19,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:19,320 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,466 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:19,466 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:19,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334925029] [2022-01-31 21:56:19,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [334925029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:19,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:19,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:19,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254709320] [2022-01-31 21:56:19,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:19,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:19,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:19,467 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:20,563 INFO L93 Difference]: Finished difference Result 676 states and 851 transitions. [2022-01-31 21:56:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-01-31 21:56:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:20,566 INFO L225 Difference]: With dead ends: 676 [2022-01-31 21:56:20,566 INFO L226 Difference]: Without dead ends: 648 [2022-01-31 21:56:20,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:20,567 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 399 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:20,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 1402 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-01-31 21:56:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2022-01-31 21:56:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 21:56:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-01-31 21:56:20,663 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-01-31 21:56:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:20,663 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-01-31 21:56:20,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-01-31 21:56:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:20,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:20,664 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] [2022-01-31 21:56:20,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:56:20,664 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash 519788489, now seen corresponding path program 1 times [2022-01-31 21:56:20,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:20,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487298047] [2022-01-31 21:56:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:20,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:20,667 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,809 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:20,809 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487298047] [2022-01-31 21:56:20,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [487298047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:20,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:20,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:20,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864152486] [2022-01-31 21:56:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:20,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:20,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:20,812 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:21,911 INFO L93 Difference]: Finished difference Result 865 states and 1111 transitions. [2022-01-31 21:56:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-01-31 21:56:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:21,914 INFO L225 Difference]: With dead ends: 865 [2022-01-31 21:56:21,914 INFO L226 Difference]: Without dead ends: 832 [2022-01-31 21:56:21,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:21,914 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 539 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:21,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 927 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-01-31 21:56:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2022-01-31 21:56:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-01-31 21:56:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2022-01-31 21:56:22,015 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2022-01-31 21:56:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:22,016 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2022-01-31 21:56:22,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2022-01-31 21:56:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:22,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:22,017 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] [2022-01-31 21:56:22,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:56:22,017 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1964857033, now seen corresponding path program 1 times [2022-01-31 21:56:22,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:22,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1556111878] [2022-01-31 21:56:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:22,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:22,021 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,199 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:22,200 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1556111878] [2022-01-31 21:56:22,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1556111878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:22,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:22,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:22,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830939970] [2022-01-31 21:56:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:22,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:22,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:22,201 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:23,230 INFO L93 Difference]: Finished difference Result 1092 states and 1408 transitions. [2022-01-31 21:56:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-01-31 21:56:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:23,233 INFO L225 Difference]: With dead ends: 1092 [2022-01-31 21:56:23,233 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 21:56:23,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:23,234 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 1420 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:23,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1435 Valid, 867 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 21:56:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2022-01-31 21:56:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-01-31 21:56:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2022-01-31 21:56:23,354 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2022-01-31 21:56:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:23,355 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2022-01-31 21:56:23,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2022-01-31 21:56:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:23,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:23,358 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] [2022-01-31 21:56:23,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:56:23,358 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 376509131, now seen corresponding path program 1 times [2022-01-31 21:56:23,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:23,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167051860] [2022-01-31 21:56:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:23,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:23,361 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,535 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:23,535 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:23,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167051860] [2022-01-31 21:56:23,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1167051860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:23,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:23,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:23,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148147983] [2022-01-31 21:56:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:23,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:23,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:23,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:23,537 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:24,854 INFO L93 Difference]: Finished difference Result 731 states and 921 transitions. [2022-01-31 21:56:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-01-31 21:56:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:24,856 INFO L225 Difference]: With dead ends: 731 [2022-01-31 21:56:24,856 INFO L226 Difference]: Without dead ends: 610 [2022-01-31 21:56:24,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:56:24,857 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 1244 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:24,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 1048 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-31 21:56:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2022-01-31 21:56:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2022-01-31 21:56:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-01-31 21:56:24,947 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-01-31 21:56:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:24,947 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-01-31 21:56:24,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-01-31 21:56:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:56:24,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:24,948 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:56:24,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:56:24,948 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash -614500354, now seen corresponding path program 1 times [2022-01-31 21:56:24,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:24,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134735130] [2022-01-31 21:56:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:24,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:24,950 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,095 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:25,095 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:25,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1134735130] [2022-01-31 21:56:25,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1134735130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:25,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:25,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:25,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036958670] [2022-01-31 21:56:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:25,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:25,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:25,096 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:26,224 INFO L93 Difference]: Finished difference Result 609 states and 770 transitions. [2022-01-31 21:56:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2022-01-31 21:56:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:26,227 INFO L225 Difference]: With dead ends: 609 [2022-01-31 21:56:26,227 INFO L226 Difference]: Without dead ends: 605 [2022-01-31 21:56:26,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:26,228 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 443 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:26,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 1585 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-01-31 21:56:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2022-01-31 21:56:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2022-01-31 21:56:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2022-01-31 21:56:26,330 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2022-01-31 21:56:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:26,331 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2022-01-31 21:56:26,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2022-01-31 21:56:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:56:26,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:26,338 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:56:26,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:56:26,343 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash -614777184, now seen corresponding path program 1 times [2022-01-31 21:56:26,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:26,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391393374] [2022-01-31 21:56:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:26,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:26,346 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,550 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:26,550 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:26,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391393374] [2022-01-31 21:56:26,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [391393374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:26,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:26,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:26,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493978408] [2022-01-31 21:56:26,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:26,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:26,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:26,552 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:27,549 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-01-31 21:56:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2022-01-31 21:56:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:27,551 INFO L225 Difference]: With dead ends: 644 [2022-01-31 21:56:27,551 INFO L226 Difference]: Without dead ends: 629 [2022-01-31 21:56:27,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:27,552 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 529 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:27,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 1614 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-01-31 21:56:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2022-01-31 21:56:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2022-01-31 21:56:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-01-31 21:56:27,647 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-01-31 21:56:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:27,647 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-01-31 21:56:27,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-01-31 21:56:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:27,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:27,648 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:56:27,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:56:27,649 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -903470965, now seen corresponding path program 1 times [2022-01-31 21:56:27,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879687423] [2022-01-31 21:56:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:27,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:27,651 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,809 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:27,809 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879687423] [2022-01-31 21:56:27,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [879687423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:27,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:27,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:27,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999665322] [2022-01-31 21:56:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:27,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:27,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:27,810 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:29,295 INFO L93 Difference]: Finished difference Result 758 states and 985 transitions. [2022-01-31 21:56:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-01-31 21:56:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:29,297 INFO L225 Difference]: With dead ends: 758 [2022-01-31 21:56:29,297 INFO L226 Difference]: Without dead ends: 740 [2022-01-31 21:56:29,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:29,298 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 954 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:29,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 921 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-01-31 21:56:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2022-01-31 21:56:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2022-01-31 21:56:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2022-01-31 21:56:29,400 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2022-01-31 21:56:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:29,400 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2022-01-31 21:56:29,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2022-01-31 21:56:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:29,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:29,401 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:29,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:56:29,401 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1947373933, now seen corresponding path program 1 times [2022-01-31 21:56:29,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858269375] [2022-01-31 21:56:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:29,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:29,403 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,561 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:29,562 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858269375] [2022-01-31 21:56:29,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [858269375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:29,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:29,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:29,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106208689] [2022-01-31 21:56:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:29,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:29,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:29,563 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:30,726 INFO L93 Difference]: Finished difference Result 608 states and 766 transitions. [2022-01-31 21:56:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-01-31 21:56:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:30,729 INFO L225 Difference]: With dead ends: 608 [2022-01-31 21:56:30,729 INFO L226 Difference]: Without dead ends: 580 [2022-01-31 21:56:30,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:30,730 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 363 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:30,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1679 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-01-31 21:56:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2022-01-31 21:56:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2022-01-31 21:56:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-01-31 21:56:30,838 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2022-01-31 21:56:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:30,839 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-01-31 21:56:30,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-01-31 21:56:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:30,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:30,839 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:30,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:56:30,840 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1340373320, now seen corresponding path program 1 times [2022-01-31 21:56:30,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:30,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [319599177] [2022-01-31 21:56:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:30,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:30,842 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:56:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,965 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:30,966 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:30,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [319599177] [2022-01-31 21:56:30,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [319599177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:30,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:30,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:30,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575160543] [2022-01-31 21:56:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:30,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:30,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:30,967 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:31,771 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2022-01-31 21:56:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 21:56:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:31,773 INFO L225 Difference]: With dead ends: 898 [2022-01-31 21:56:31,773 INFO L226 Difference]: Without dead ends: 589 [2022-01-31 21:56:31,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:31,775 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 393 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:31,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 817 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-31 21:56:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-01-31 21:56:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2022-01-31 21:56:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-01-31 21:56:31,875 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2022-01-31 21:56:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:31,876 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-01-31 21:56:31,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-01-31 21:56:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:56:31,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:31,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:31,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:56:31,877 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1752890422, now seen corresponding path program 1 times [2022-01-31 21:56:31,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:31,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341923646] [2022-01-31 21:56:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:31,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:31,880 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,078 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:32,079 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341923646] [2022-01-31 21:56:32,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [341923646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:32,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:32,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:32,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871230166] [2022-01-31 21:56:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:32,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:32,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:32,080 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:33,137 INFO L93 Difference]: Finished difference Result 852 states and 1088 transitions. [2022-01-31 21:56:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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 64 [2022-01-31 21:56:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:33,139 INFO L225 Difference]: With dead ends: 852 [2022-01-31 21:56:33,139 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 21:56:33,141 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:33,141 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 302 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:33,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 1212 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 21:56:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-01-31 21:56:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2022-01-31 21:56:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-01-31 21:56:33,258 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-01-31 21:56:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:33,258 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-01-31 21:56:33,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 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:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-01-31 21:56:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:56:33,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:33,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:33,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:56:33,260 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -557797138, now seen corresponding path program 1 times [2022-01-31 21:56:33,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:33,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193890651] [2022-01-31 21:56:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:33,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:33,262 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:56:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,450 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:33,450 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:33,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193890651] [2022-01-31 21:56:33,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [193890651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:33,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:33,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:33,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006181453] [2022-01-31 21:56:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:33,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:33,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:33,452 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:34,708 INFO L93 Difference]: Finished difference Result 545 states and 678 transitions. [2022-01-31 21:56:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:34,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-01-31 21:56:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:34,710 INFO L225 Difference]: With dead ends: 545 [2022-01-31 21:56:34,710 INFO L226 Difference]: Without dead ends: 524 [2022-01-31 21:56:34,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:34,711 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 507 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:34,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1186 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-01-31 21:56:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-01-31 21:56:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2022-01-31 21:56:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-01-31 21:56:34,813 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-01-31 21:56:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:34,814 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-01-31 21:56:34,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-01-31 21:56:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:34,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:34,815 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:34,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:56:34,815 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2048336817, now seen corresponding path program 1 times [2022-01-31 21:56:34,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:34,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1233055861] [2022-01-31 21:56:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:34,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:34,817 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,977 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:34,977 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:34,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1233055861] [2022-01-31 21:56:34,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1233055861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:34,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:34,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:34,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006193400] [2022-01-31 21:56:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:34,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:34,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:34,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:34,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:34,978 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:35,972 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2022-01-31 21:56:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:35,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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 58 [2022-01-31 21:56:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:35,975 INFO L225 Difference]: With dead ends: 538 [2022-01-31 21:56:35,975 INFO L226 Difference]: Without dead ends: 520 [2022-01-31 21:56:35,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:35,976 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 366 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:35,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 1556 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-31 21:56:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-01-31 21:56:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 21:56:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-01-31 21:56:36,085 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-01-31 21:56:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:36,085 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-01-31 21:56:36,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-01-31 21:56:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:56:36,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:36,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:36,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:56:36,086 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 853367933, now seen corresponding path program 1 times [2022-01-31 21:56:36,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:36,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522665940] [2022-01-31 21:56:36,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:36,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:36,089 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,230 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:36,230 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:36,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522665940] [2022-01-31 21:56:36,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1522665940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:36,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:36,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:36,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866482148] [2022-01-31 21:56:36,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:36,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:36,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:36,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:36,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:36,231 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:37,265 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2022-01-31 21:56:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 21:56:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:37,267 INFO L225 Difference]: With dead ends: 539 [2022-01-31 21:56:37,267 INFO L226 Difference]: Without dead ends: 515 [2022-01-31 21:56:37,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:37,268 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 399 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:37,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 844 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-01-31 21:56:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-01-31 21:56:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 21:56:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-01-31 21:56:37,357 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-01-31 21:56:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:37,357 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-01-31 21:56:37,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-01-31 21:56:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 21:56:37,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:37,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:37,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:56:37,358 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1746189105, now seen corresponding path program 1 times [2022-01-31 21:56:37,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:37,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434419953] [2022-01-31 21:56:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:37,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:37,360 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,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:37,500 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434419953] [2022-01-31 21:56:37,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1434419953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:37,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:37,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:37,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953958295] [2022-01-31 21:56:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:37,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:37,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:37,501 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:38,586 INFO L93 Difference]: Finished difference Result 780 states and 980 transitions. [2022-01-31 21:56:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-01-31 21:56:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:38,588 INFO L225 Difference]: With dead ends: 780 [2022-01-31 21:56:38,588 INFO L226 Difference]: Without dead ends: 521 [2022-01-31 21:56:38,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:56:38,589 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 624 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:38,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1041 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-31 21:56:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-01-31 21:56:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 21:56:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-01-31 21:56:38,679 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-01-31 21:56:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:38,679 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-01-31 21:56:38,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-01-31 21:56:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:56:38,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:38,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:38,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:56:38,680 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -662819238, now seen corresponding path program 1 times [2022-01-31 21:56:38,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [998783248] [2022-01-31 21:56:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:38,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:38,682 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:38,832 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:38,832 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:38,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [998783248] [2022-01-31 21:56:38,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [998783248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:38,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:38,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:38,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494238385] [2022-01-31 21:56:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:38,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:38,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:38,835 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:40,001 INFO L93 Difference]: Finished difference Result 611 states and 749 transitions. [2022-01-31 21:56:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 21:56:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:40,004 INFO L225 Difference]: With dead ends: 611 [2022-01-31 21:56:40,005 INFO L226 Difference]: Without dead ends: 519 [2022-01-31 21:56:40,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:40,005 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 257 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:40,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 814 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-31 21:56:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-01-31 21:56:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-01-31 21:56:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-01-31 21:56:40,110 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-01-31 21:56:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:40,110 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-01-31 21:56:40,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-01-31 21:56:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:56:40,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:40,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:40,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:56:40,111 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1616978329, now seen corresponding path program 1 times [2022-01-31 21:56:40,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:40,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2008815651] [2022-01-31 21:56:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:40,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:40,113 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,304 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:40,304 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:40,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2008815651] [2022-01-31 21:56:40,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2008815651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:40,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:40,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:40,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680883803] [2022-01-31 21:56:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:40,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:40,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:40,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:40,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:40,306 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:41,440 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2022-01-31 21:56:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 21:56:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:41,442 INFO L225 Difference]: With dead ends: 529 [2022-01-31 21:56:41,442 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 21:56:41,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:56:41,442 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 429 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:41,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 972 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 21:56:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-01-31 21:56:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 21:56:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-01-31 21:56:41,529 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-01-31 21:56:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:41,529 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-01-31 21:56:41,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-01-31 21:56:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:56:41,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:41,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:41,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:56:41,531 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1834799191, now seen corresponding path program 1 times [2022-01-31 21:56:41,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159862480] [2022-01-31 21:56:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:41,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:41,533 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,706 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:41,706 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:41,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159862480] [2022-01-31 21:56:41,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [159862480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:41,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:41,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:41,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008278238] [2022-01-31 21:56:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:41,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:41,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:41,707 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:42,869 INFO L93 Difference]: Finished difference Result 522 states and 642 transitions. [2022-01-31 21:56:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:42,869 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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 63 [2022-01-31 21:56:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:42,871 INFO L225 Difference]: With dead ends: 522 [2022-01-31 21:56:42,871 INFO L226 Difference]: Without dead ends: 501 [2022-01-31 21:56:42,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:42,871 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 308 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:42,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1667 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-31 21:56:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-01-31 21:56:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-01-31 21:56:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2022-01-31 21:56:42,961 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2022-01-31 21:56:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:42,961 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2022-01-31 21:56:42,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2022-01-31 21:56:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:56:42,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:42,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:42,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:56:42,963 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2018781837, now seen corresponding path program 1 times [2022-01-31 21:56:42,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046027381] [2022-01-31 21:56:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:42,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:42,965 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,152 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:43,152 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046027381] [2022-01-31 21:56:43,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2046027381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:43,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:43,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:43,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195373134] [2022-01-31 21:56:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:43,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:43,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:43,153 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:44,091 INFO L93 Difference]: Finished difference Result 746 states and 929 transitions. [2022-01-31 21:56:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-01-31 21:56:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:44,093 INFO L225 Difference]: With dead ends: 746 [2022-01-31 21:56:44,093 INFO L226 Difference]: Without dead ends: 520 [2022-01-31 21:56:44,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:44,094 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 552 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:44,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 1352 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-31 21:56:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2022-01-31 21:56:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-01-31 21:56:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-01-31 21:56:44,184 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2022-01-31 21:56:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:44,185 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-01-31 21:56:44,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-01-31 21:56:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:56:44,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:44,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:44,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:56:44,186 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2107854790, now seen corresponding path program 1 times [2022-01-31 21:56:44,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:44,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335591140] [2022-01-31 21:56:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:44,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:44,188 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:56:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,346 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:44,346 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:44,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [335591140] [2022-01-31 21:56:44,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [335591140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:44,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:44,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:44,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565524558] [2022-01-31 21:56:44,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:44,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:44,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:44,349 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:45,222 INFO L93 Difference]: Finished difference Result 512 states and 627 transitions. [2022-01-31 21:56:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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 64 [2022-01-31 21:56:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:45,224 INFO L225 Difference]: With dead ends: 512 [2022-01-31 21:56:45,224 INFO L226 Difference]: Without dead ends: 490 [2022-01-31 21:56:45,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:45,225 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 411 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:45,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1433 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-01-31 21:56:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-01-31 21:56:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2022-01-31 21:56:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-01-31 21:56:45,310 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-01-31 21:56:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:45,310 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-01-31 21:56:45,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-01-31 21:56:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:56:45,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:45,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:45,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:56:45,311 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 245569005, now seen corresponding path program 1 times [2022-01-31 21:56:45,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:45,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660309492] [2022-01-31 21:56:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:45,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:45,316 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,480 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:45,481 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:45,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660309492] [2022-01-31 21:56:45,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [660309492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:45,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:45,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:45,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138183546] [2022-01-31 21:56:45,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:45,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:45,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:45,482 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:46,456 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-01-31 21:56:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64 [2022-01-31 21:56:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:46,457 INFO L225 Difference]: With dead ends: 507 [2022-01-31 21:56:46,458 INFO L226 Difference]: Without dead ends: 485 [2022-01-31 21:56:46,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:46,458 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 455 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:46,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1662 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-01-31 21:56:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-01-31 21:56:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 21:56:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-01-31 21:56:46,542 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-01-31 21:56:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:46,542 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-01-31 21:56:46,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-01-31 21:56:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:56:46,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:46,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:46,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:56:46,543 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -684542465, now seen corresponding path program 1 times [2022-01-31 21:56:46,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:46,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288359823] [2022-01-31 21:56:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:46,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:46,545 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:46,698 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288359823] [2022-01-31 21:56:46,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1288359823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:46,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:46,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:46,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285371173] [2022-01-31 21:56:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:46,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:46,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:46,700 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:47,637 INFO L93 Difference]: Finished difference Result 502 states and 612 transitions. [2022-01-31 21:56:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64 [2022-01-31 21:56:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:47,639 INFO L225 Difference]: With dead ends: 502 [2022-01-31 21:56:47,639 INFO L226 Difference]: Without dead ends: 481 [2022-01-31 21:56:47,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:47,640 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:47,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1554 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-01-31 21:56:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-01-31 21:56:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2022-01-31 21:56:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-01-31 21:56:47,731 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-01-31 21:56:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:47,731 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-01-31 21:56:47,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-01-31 21:56:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:56:47,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:47,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:47,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:56:47,733 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash 387945384, now seen corresponding path program 1 times [2022-01-31 21:56:47,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:47,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831712708] [2022-01-31 21:56:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:47,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:47,734 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,848 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:47,848 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831712708] [2022-01-31 21:56:47,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [831712708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:47,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:47,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:47,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494726080] [2022-01-31 21:56:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:47,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:47,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:47,849 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:48,590 INFO L93 Difference]: Finished difference Result 878 states and 1082 transitions. [2022-01-31 21:56:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-01-31 21:56:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:48,596 INFO L225 Difference]: With dead ends: 878 [2022-01-31 21:56:48,596 INFO L226 Difference]: Without dead ends: 625 [2022-01-31 21:56:48,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:48,597 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 724 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:48,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 884 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-01-31 21:56:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-01-31 21:56:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2022-01-31 21:56:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-01-31 21:56:48,716 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 73 [2022-01-31 21:56:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:48,716 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-01-31 21:56:48,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-01-31 21:56:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 21:56:48,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:48,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:48,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:56:48,717 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1771054254, now seen corresponding path program 1 times [2022-01-31 21:56:48,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829277743] [2022-01-31 21:56:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:48,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:48,719 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 21:56:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,866 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:48,866 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829277743] [2022-01-31 21:56:48,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [829277743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:48,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:48,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:48,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032257442] [2022-01-31 21:56:48,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:48,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:48,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:48,867 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:49,740 INFO L93 Difference]: Finished difference Result 619 states and 755 transitions. [2022-01-31 21:56:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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 68 [2022-01-31 21:56:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:49,742 INFO L225 Difference]: With dead ends: 619 [2022-01-31 21:56:49,742 INFO L226 Difference]: Without dead ends: 576 [2022-01-31 21:56:49,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:49,743 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 559 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:49,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1423 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-01-31 21:56:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-01-31 21:56:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2022-01-31 21:56:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-01-31 21:56:49,843 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-01-31 21:56:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:49,843 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-01-31 21:56:49,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-01-31 21:56:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:56:49,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:49,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:49,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:56:49,844 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -699513037, now seen corresponding path program 1 times [2022-01-31 21:56:49,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:49,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [742013759] [2022-01-31 21:56:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:49,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:49,846 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,025 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:50,025 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [742013759] [2022-01-31 21:56:50,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [742013759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:50,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:50,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:50,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305266274] [2022-01-31 21:56:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:50,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:50,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:50,026 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:51,300 INFO L93 Difference]: Finished difference Result 589 states and 718 transitions. [2022-01-31 21:56:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:56:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-01-31 21:56:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:51,302 INFO L225 Difference]: With dead ends: 589 [2022-01-31 21:56:51,302 INFO L226 Difference]: Without dead ends: 535 [2022-01-31 21:56:51,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:56:51,303 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 382 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:51,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 902 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-01-31 21:56:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-01-31 21:56:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2022-01-31 21:56:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-01-31 21:56:51,403 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-01-31 21:56:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:51,403 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-01-31 21:56:51,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-01-31 21:56:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 21:56:51,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:51,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:56:51,404 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1796970753, now seen corresponding path program 1 times [2022-01-31 21:56:51,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889881675] [2022-01-31 21:56:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:51,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:51,406 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,543 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:51,544 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:51,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889881675] [2022-01-31 21:56:51,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1889881675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:51,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:51,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:51,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965423957] [2022-01-31 21:56:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:51,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:51,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:51,545 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:56:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:52,382 INFO L93 Difference]: Finished difference Result 840 states and 1028 transitions. [2022-01-31 21:56:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-01-31 21:56:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:52,384 INFO L225 Difference]: With dead ends: 840 [2022-01-31 21:56:52,384 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 21:56:52,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:56:52,385 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 389 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:52,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 1142 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 21:56:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-01-31 21:56:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 21:56:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-01-31 21:56:52,480 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-01-31 21:56:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:52,480 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-01-31 21:56:52,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:56:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-01-31 21:56:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 21:56:52,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:52,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:52,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:56:52,481 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2026941125, now seen corresponding path program 1 times [2022-01-31 21:56:52,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1019891457] [2022-01-31 21:56:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:52,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:52,483 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 21:56:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,695 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:52,695 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1019891457] [2022-01-31 21:56:52,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1019891457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:52,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:52,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:52,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915524127] [2022-01-31 21:56:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:52,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:52,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:52,696 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:53,518 INFO L93 Difference]: Finished difference Result 839 states and 1046 transitions. [2022-01-31 21:56:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:56:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-01-31 21:56:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:53,523 INFO L225 Difference]: With dead ends: 839 [2022-01-31 21:56:53,523 INFO L226 Difference]: Without dead ends: 585 [2022-01-31 21:56:53,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:53,524 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 526 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:53,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 1426 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-31 21:56:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-01-31 21:56:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 21:56:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-01-31 21:56:53,622 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-01-31 21:56:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:53,622 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-01-31 21:56:53,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-01-31 21:56:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 21:56:53,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:53,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:53,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:56:53,623 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -564339607, now seen corresponding path program 1 times [2022-01-31 21:56:53,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907621786] [2022-01-31 21:56:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:53,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:53,625 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:53,824 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:53,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [907621786] [2022-01-31 21:56:53,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [907621786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:53,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:53,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:53,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849914547] [2022-01-31 21:56:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:53,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:53,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:53,825 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:54,759 INFO L93 Difference]: Finished difference Result 526 states and 629 transitions. [2022-01-31 21:56:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-01-31 21:56:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:54,761 INFO L225 Difference]: With dead ends: 526 [2022-01-31 21:56:54,761 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 21:56:54,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:54,762 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 359 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:54,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1564 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 21:56:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-01-31 21:56:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-01-31 21:56:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-01-31 21:56:54,867 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-01-31 21:56:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:54,868 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-01-31 21:56:54,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-01-31 21:56:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 21:56:54,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:54,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:54,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:56:54,869 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1551103562, now seen corresponding path program 1 times [2022-01-31 21:56:54,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:54,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596651616] [2022-01-31 21:56:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:54,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:54,870 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 21:56:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,062 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:55,062 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596651616] [2022-01-31 21:56:55,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1596651616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:55,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:55,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:55,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235156140] [2022-01-31 21:56:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:55,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:55,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:55,063 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:55,907 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2022-01-31 21:56:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:56:55,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2022-01-31 21:56:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:55,909 INFO L225 Difference]: With dead ends: 526 [2022-01-31 21:56:55,910 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 21:56:55,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:56:55,910 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 409 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:55,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 1709 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 21:56:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-01-31 21:56:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 21:56:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-01-31 21:56:56,013 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-01-31 21:56:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:56,013 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-01-31 21:56:56,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-01-31 21:56:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 21:56:56,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:56,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:56,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:56:56,014 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 945867422, now seen corresponding path program 1 times [2022-01-31 21:56:56,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:56,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747310118] [2022-01-31 21:56:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:56,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:56,016 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:56:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,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:56:56,164 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:56,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747310118] [2022-01-31 21:56:56,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1747310118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:56,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:56,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:56,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592595569] [2022-01-31 21:56:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:56,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:56,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:56,165 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:56:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:57,110 INFO L93 Difference]: Finished difference Result 910 states and 1073 transitions. [2022-01-31 21:56:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-31 21:56:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:57,112 INFO L225 Difference]: With dead ends: 910 [2022-01-31 21:56:57,112 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 21:56:57,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:56:57,113 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 708 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:57,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 542 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 21:56:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2022-01-31 21:56:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2022-01-31 21:56:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2022-01-31 21:56:57,237 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2022-01-31 21:56:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:57,237 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2022-01-31 21:56:57,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:56:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2022-01-31 21:56:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 21:56:57,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:57,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:57,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:56:57,238 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 680283571, now seen corresponding path program 1 times [2022-01-31 21:56:57,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:57,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730017535] [2022-01-31 21:56:57,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:57,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:57,240 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:57,437 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:57,437 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:57,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730017535] [2022-01-31 21:56:57,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [730017535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:57,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:57,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:57,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234774631] [2022-01-31 21:56:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:57,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:57,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:57,438 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:58,453 INFO L93 Difference]: Finished difference Result 590 states and 692 transitions. [2022-01-31 21:56:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2022-01-31 21:56:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:58,454 INFO L225 Difference]: With dead ends: 590 [2022-01-31 21:56:58,454 INFO L226 Difference]: Without dead ends: 498 [2022-01-31 21:56:58,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:56:58,455 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 306 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:58,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 644 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-01-31 21:56:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2022-01-31 21:56:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 21:56:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2022-01-31 21:56:58,565 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2022-01-31 21:56:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:58,566 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2022-01-31 21:56:58,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2022-01-31 21:56:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 21:56:58,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:58,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:56:58,567 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 313967105, now seen corresponding path program 1 times [2022-01-31 21:56:58,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:58,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659370755] [2022-01-31 21:56:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:58,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:58,569 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 21:56:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:58,755 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:58,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659370755] [2022-01-31 21:56:58,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [659370755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:58,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:58,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:58,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667961522] [2022-01-31 21:56:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:58,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:58,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:58,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:58,756 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:56:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:59,256 INFO L93 Difference]: Finished difference Result 531 states and 619 transitions. [2022-01-31 21:56:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:59,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-01-31 21:56:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:59,257 INFO L225 Difference]: With dead ends: 531 [2022-01-31 21:56:59,257 INFO L226 Difference]: Without dead ends: 492 [2022-01-31 21:56:59,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:59,258 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 187 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:59,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 930 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-31 21:56:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2022-01-31 21:56:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2022-01-31 21:56:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2022-01-31 21:56:59,359 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2022-01-31 21:56:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:59,359 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2022-01-31 21:56:59,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:56:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2022-01-31 21:56:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 21:56:59,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:59,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:56:59,360 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1018925480, now seen corresponding path program 1 times [2022-01-31 21:56:59,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148179089] [2022-01-31 21:56:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:59,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:59,362 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:56:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 21:56:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:59,542 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:59,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148179089] [2022-01-31 21:56:59,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [148179089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:59,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:59,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:59,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895788635] [2022-01-31 21:56:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:59,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:59,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:59,543 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:57:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:00,434 INFO L93 Difference]: Finished difference Result 842 states and 986 transitions. [2022-01-31 21:57:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:57:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2022-01-31 21:57:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:00,437 INFO L225 Difference]: With dead ends: 842 [2022-01-31 21:57:00,437 INFO L226 Difference]: Without dead ends: 797 [2022-01-31 21:57:00,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:57:00,438 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 579 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:00,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1614 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:57:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-01-31 21:57:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2022-01-31 21:57:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 21:57:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2022-01-31 21:57:00,543 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2022-01-31 21:57:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:00,543 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2022-01-31 21:57:00,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:57:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2022-01-31 21:57:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 21:57:00,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:00,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:57:00,544 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1434876468, now seen corresponding path program 1 times [2022-01-31 21:57:00,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:00,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254481001] [2022-01-31 21:57:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:00,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:00,546 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 21:57:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:00,814 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:57:00,814 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254481001] [2022-01-31 21:57:00,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [254481001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:00,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:00,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:00,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934535811] [2022-01-31 21:57:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:00,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:00,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:00,816 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 21:57:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:01,632 INFO L93 Difference]: Finished difference Result 561 states and 656 transitions. [2022-01-31 21:57:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:57:01,632 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-01-31 21:57:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:01,635 INFO L225 Difference]: With dead ends: 561 [2022-01-31 21:57:01,636 INFO L226 Difference]: Without dead ends: 438 [2022-01-31 21:57:01,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:57:01,636 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 134 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:01,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1143 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:57:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-31 21:57:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2022-01-31 21:57:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 21:57:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2022-01-31 21:57:01,745 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2022-01-31 21:57:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:01,745 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2022-01-31 21:57:01,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 21:57:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2022-01-31 21:57:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 21:57:01,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:01,746 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:01,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:57:01,747 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash -679170353, now seen corresponding path program 1 times [2022-01-31 21:57:01,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:01,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2092352362] [2022-01-31 21:57:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:01,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:01,749 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:57:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 21:57:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,918 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:57:01,918 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2092352362] [2022-01-31 21:57:01,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2092352362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:01,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:01,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:57:01,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735046441] [2022-01-31 21:57:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:01,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:57:01,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:57:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:57:01,920 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:57:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:02,333 INFO L93 Difference]: Finished difference Result 749 states and 870 transitions. [2022-01-31 21:57:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-01-31 21:57:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:02,337 INFO L225 Difference]: With dead ends: 749 [2022-01-31 21:57:02,337 INFO L226 Difference]: Without dead ends: 440 [2022-01-31 21:57:02,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:57:02,338 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 181 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:02,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 765 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:57:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-01-31 21:57:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2022-01-31 21:57:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2022-01-31 21:57:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2022-01-31 21:57:02,448 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2022-01-31 21:57:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:02,449 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2022-01-31 21:57:02,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:57:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2022-01-31 21:57:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 21:57:02,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:02,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:57:02,450 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash 857265326, now seen corresponding path program 1 times [2022-01-31 21:57:02,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:02,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297184220] [2022-01-31 21:57:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:02,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:02,452 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:57:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 21:57:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:02,637 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:57:02,638 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:02,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297184220] [2022-01-31 21:57:02,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [297184220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:02,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:02,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:57:02,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005578065] [2022-01-31 21:57:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:02,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:57:02,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:57:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:57:02,644 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 21:57:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:03,157 INFO L93 Difference]: Finished difference Result 471 states and 535 transitions. [2022-01-31 21:57:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:57:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2022-01-31 21:57:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:03,158 INFO L225 Difference]: With dead ends: 471 [2022-01-31 21:57:03,159 INFO L226 Difference]: Without dead ends: 387 [2022-01-31 21:57:03,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:57:03,160 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 156 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:03,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 892 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:57:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-01-31 21:57:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2022-01-31 21:57:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 21:57:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2022-01-31 21:57:03,228 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2022-01-31 21:57:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:03,228 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2022-01-31 21:57:03,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 21:57:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2022-01-31 21:57:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 21:57:03,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:03,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:57:03,229 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2021247887, now seen corresponding path program 1 times [2022-01-31 21:57:03,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:03,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534215254] [2022-01-31 21:57:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:03,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:03,230 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:57:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:57:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,426 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:57:03,426 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:03,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534215254] [2022-01-31 21:57:03,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1534215254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:03,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:03,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:57:03,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613789681] [2022-01-31 21:57:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:03,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:57:03,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:03,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:57:03,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:03,427 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:57:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:03,949 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2022-01-31 21:57:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 21:57:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:03,960 INFO L225 Difference]: With dead ends: 293 [2022-01-31 21:57:03,960 INFO L226 Difference]: Without dead ends: 263 [2022-01-31 21:57:03,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:03,960 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 250 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:03,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 758 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:57:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-31 21:57:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2022-01-31 21:57:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2022-01-31 21:57:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2022-01-31 21:57:04,030 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2022-01-31 21:57:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:04,030 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2022-01-31 21:57:04,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:57:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2022-01-31 21:57:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 21:57:04,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:04,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:57:04,031 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2092232912, now seen corresponding path program 1 times [2022-01-31 21:57:04,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:04,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229966509] [2022-01-31 21:57:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:04,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:04,033 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:57:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:57:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,227 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:57:04,228 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229966509] [2022-01-31 21:57:04,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [229966509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:04,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:04,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:57:04,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630045308] [2022-01-31 21:57:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:04,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:57:04,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:04,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:57:04,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:04,230 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:57:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:04,703 INFO L93 Difference]: Finished difference Result 339 states and 377 transitions. [2022-01-31 21:57:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 21:57:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:04,704 INFO L225 Difference]: With dead ends: 339 [2022-01-31 21:57:04,704 INFO L226 Difference]: Without dead ends: 254 [2022-01-31 21:57:04,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:04,704 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 241 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:04,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 751 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:57:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-31 21:57:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-01-31 21:57:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 21:57:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2022-01-31 21:57:04,773 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2022-01-31 21:57:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:04,773 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2022-01-31 21:57:04,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:57:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2022-01-31 21:57:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-31 21:57:04,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:04,774 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:57:04,774 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash 90302461, now seen corresponding path program 1 times [2022-01-31 21:57:04,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:04,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482456225] [2022-01-31 21:57:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:04,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:04,776 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 21:57:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 21:57:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,155 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:57:05,155 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482456225] [2022-01-31 21:57:05,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [482456225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:05,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:05,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:57:05,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825214313] [2022-01-31 21:57:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:05,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:57:05,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:57:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:57:05,156 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:57:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:06,060 INFO L93 Difference]: Finished difference Result 320 states and 360 transitions. [2022-01-31 21:57:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:57:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-01-31 21:57:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:06,061 INFO L225 Difference]: With dead ends: 320 [2022-01-31 21:57:06,062 INFO L226 Difference]: Without dead ends: 285 [2022-01-31 21:57:06,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:57:06,062 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 194 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:06,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1498 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:57:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-31 21:57:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2022-01-31 21:57:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 21:57:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2022-01-31 21:57:06,142 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2022-01-31 21:57:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:06,142 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2022-01-31 21:57:06,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:57:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2022-01-31 21:57:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-31 21:57:06,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:06,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:06,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:57:06,143 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1191115682, now seen corresponding path program 1 times [2022-01-31 21:57:06,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985794292] [2022-01-31 21:57:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:06,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:06,145 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 21:57:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:57:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:06,429 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:57:06,429 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:06,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985794292] [2022-01-31 21:57:06,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1985794292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:06,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:06,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:06,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693692919] [2022-01-31 21:57:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:06,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:06,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:06,430 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:57:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:06,977 INFO L93 Difference]: Finished difference Result 360 states and 402 transitions. [2022-01-31 21:57:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:57:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-01-31 21:57:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:06,978 INFO L225 Difference]: With dead ends: 360 [2022-01-31 21:57:06,978 INFO L226 Difference]: Without dead ends: 279 [2022-01-31 21:57:06,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:57:06,979 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 244 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:06,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1117 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:57:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-31 21:57:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2022-01-31 21:57:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 21:57:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2022-01-31 21:57:07,056 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2022-01-31 21:57:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:07,056 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2022-01-31 21:57:07,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:57:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2022-01-31 21:57:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-31 21:57:07,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:07,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:57:07,057 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1843438784, now seen corresponding path program 1 times [2022-01-31 21:57:07,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:07,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [856786502] [2022-01-31 21:57:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:07,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:07,059 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 21:57:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 21:57:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 21:57:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:07,361 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:57:07,361 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:07,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [856786502] [2022-01-31 21:57:07,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [856786502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:07,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:07,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:57:07,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504400181] [2022-01-31 21:57:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:07,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:57:07,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:57:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:07,362 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:57:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:08,106 INFO L93 Difference]: Finished difference Result 306 states and 340 transitions. [2022-01-31 21:57:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:57:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-01-31 21:57:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:08,107 INFO L225 Difference]: With dead ends: 306 [2022-01-31 21:57:08,107 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 21:57:08,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:57:08,108 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 194 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:08,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1121 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:57:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 21:57:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2022-01-31 21:57:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 21:57:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2022-01-31 21:57:08,180 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2022-01-31 21:57:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:08,180 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2022-01-31 21:57:08,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:57:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2022-01-31 21:57:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 21:57:08,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:08,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:57:08,181 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2010865059, now seen corresponding path program 1 times [2022-01-31 21:57:08,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:08,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443297424] [2022-01-31 21:57:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:08,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:08,183 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 21:57:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 21:57:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 21:57:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,421 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:57:08,422 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443297424] [2022-01-31 21:57:08,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1443297424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:08,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:08,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:57:08,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221774019] [2022-01-31 21:57:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:08,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:57:08,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:57:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:08,423 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 21:57:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:08,907 INFO L93 Difference]: Finished difference Result 320 states and 349 transitions. [2022-01-31 21:57:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2022-01-31 21:57:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:08,908 INFO L225 Difference]: With dead ends: 320 [2022-01-31 21:57:08,908 INFO L226 Difference]: Without dead ends: 245 [2022-01-31 21:57:08,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:57:08,909 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 349 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:08,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 498 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:57:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-31 21:57:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2022-01-31 21:57:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2022-01-31 21:57:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2022-01-31 21:57:08,975 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2022-01-31 21:57:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:08,975 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2022-01-31 21:57:08,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 21:57:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2022-01-31 21:57:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-31 21:57:08,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:08,976 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:57:08,976 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash 473656636, now seen corresponding path program 1 times [2022-01-31 21:57:08,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:08,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699476068] [2022-01-31 21:57:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:08,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:08,978 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:57:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 21:57:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 21:57:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,230 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:57:09,230 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:09,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699476068] [2022-01-31 21:57:09,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [699476068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:09,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:09,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:57:09,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253707056] [2022-01-31 21:57:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:09,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:57:09,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:57:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:57:09,231 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:57:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:09,616 INFO L93 Difference]: Finished difference Result 296 states and 320 transitions. [2022-01-31 21:57:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-01-31 21:57:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:09,617 INFO L225 Difference]: With dead ends: 296 [2022-01-31 21:57:09,617 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 21:57:09,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:57:09,618 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 150 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:09,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 683 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:57:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 21:57:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-01-31 21:57:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 21:57:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2022-01-31 21:57:09,672 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2022-01-31 21:57:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:09,672 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2022-01-31 21:57:09,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:57:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2022-01-31 21:57:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 21:57:09,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:09,673 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 21:57:09,673 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -155521920, now seen corresponding path program 1 times [2022-01-31 21:57:09,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:09,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035582854] [2022-01-31 21:57:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:09,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:09,675 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 21:57:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:57:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 21:57:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:09,970 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:57:09,970 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:09,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035582854] [2022-01-31 21:57:09,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1035582854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:09,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:09,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:57:09,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252334300] [2022-01-31 21:57:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:09,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:57:09,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:57:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:57:09,971 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:57:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:10,960 INFO L93 Difference]: Finished difference Result 414 states and 443 transitions. [2022-01-31 21:57:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:57:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 21:57:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:10,962 INFO L225 Difference]: With dead ends: 414 [2022-01-31 21:57:10,962 INFO L226 Difference]: Without dead ends: 213 [2022-01-31 21:57:10,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:57:10,963 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 487 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:10,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 640 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:57:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-31 21:57:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2022-01-31 21:57:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 21:57:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2022-01-31 21:57:11,021 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2022-01-31 21:57:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:11,021 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2022-01-31 21:57:11,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:57:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-01-31 21:57:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 21:57:11,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:11,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:11,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 21:57:11,023 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1078689346, now seen corresponding path program 1 times [2022-01-31 21:57:11,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:11,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976972680] [2022-01-31 21:57:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:11,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:11,024 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:57:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:57:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 21:57:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:57:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 21:57:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:11,377 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:57:11,377 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:11,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976972680] [2022-01-31 21:57:11,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1976972680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:11,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:11,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:57:11,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800676925] [2022-01-31 21:57:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:11,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:57:11,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:57:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:57:11,378 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:57:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:12,248 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-01-31 21:57:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:57:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 21:57:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:12,249 INFO L225 Difference]: With dead ends: 213 [2022-01-31 21:57:12,249 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:57:12,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:57:12,252 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 441 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:12,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 706 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:57:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:57:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:57:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 21:57:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:57:12,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-01-31 21:57:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:12,253 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:57:12,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:57:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:57:12,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:57:12,255 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:57:12,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 21:57:12,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.