/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:37:58,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:37:58,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:37:59,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:37:59,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:37:59,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:37:59,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:37:59,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:37:59,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:37:59,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:37:59,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:37:59,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:37:59,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:37:59,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:37:59,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:37:59,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:37:59,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:37:59,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:37:59,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:37:59,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:37:59,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:37:59,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:37:59,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:37:59,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:37:59,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:37:59,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:37:59,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:37:59,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:37:59,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:37:59,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:37:59,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:37:59,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:37:59,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:37:59,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:37:59,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:37:59,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:37:59,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:37:59,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:37:59,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:37:59,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:37:59,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:37:59,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:37:59,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:37:59,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:37:59,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:37:59,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:37:59,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:37:59,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:37:59,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:37:59,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:37:59,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:37:59,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:37:59,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:37:59,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:37:59,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:37:59,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:37:59,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:37:59,083 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:37:59,083 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 00:37:59,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:37:59,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:37:59,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:37:59,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:37:59,304 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:37:59,305 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-02-15 00:37:59,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aaee556/a30c0a81197747f7aa7a36e8bfdd9e7b/FLAG60e27c463 [2022-02-15 00:37:59,718 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:37:59,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-02-15 00:37:59,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aaee556/a30c0a81197747f7aa7a36e8bfdd9e7b/FLAG60e27c463 [2022-02-15 00:38:00,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aaee556/a30c0a81197747f7aa7a36e8bfdd9e7b [2022-02-15 00:38:00,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:38:00,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:38:00,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:38:00,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:38:00,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:38:00,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d938619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00, skipping insertion in model container [2022-02-15 00:38:00,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:38:00,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:38:00,341 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-02-15 00:38:00,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:38:00,351 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:38:00,458 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-02-15 00:38:00,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:38:00,470 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:38:00,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00 WrapperNode [2022-02-15 00:38:00,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:38:00,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:38:00,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:38:00,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:38:00,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:38:00,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:38:00,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:38:00,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:38:00,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (1/1) ... [2022-02-15 00:38:00,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:38:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:38:00,610 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-02-15 00:38:00,613 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-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-02-15 00:38:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-15 00:38:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-02-15 00:38:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-15 00:38:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:38:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:38:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:38:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-02-15 00:38:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-15 00:38:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:38:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:38:00,829 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:38:00,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:38:00,865 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:00,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:00,895 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:00,911 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:00,922 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:00,923 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:00,931 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,071 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-02-15 00:38:01,072 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-02-15 00:38:01,076 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,138 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-02-15 00:38:01,139 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-02-15 00:38:01,146 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-15 00:38:01,158 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-15 00:38:01,226 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,233 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,240 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,240 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,240 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,247 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,247 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,273 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-15 00:38:01,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-15 00:38:01,296 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,361 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-02-15 00:38:01,361 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-02-15 00:38:01,387 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,390 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,390 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,391 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,394 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,394 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,395 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:38:01,398 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:38:01,398 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:38:01,408 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:38:01,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:38:01,415 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:38:01,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:38:01 BoogieIcfgContainer [2022-02-15 00:38:01,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:38:01,418 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:38:01,418 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:38:01,419 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:38:01,421 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:38:01" (1/1) ... [2022-02-15 00:38:01,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:38:01 BasicIcfg [2022-02-15 00:38:01,450 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:38:01,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:38:01,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:38:01,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:38:01,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:38:00" (1/4) ... [2022-02-15 00:38:01,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2ae2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:38:01, skipping insertion in model container [2022-02-15 00:38:01,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:38:00" (2/4) ... [2022-02-15 00:38:01,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2ae2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:38:01, skipping insertion in model container [2022-02-15 00:38:01,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:38:01" (3/4) ... [2022-02-15 00:38:01,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2ae2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:38:01, skipping insertion in model container [2022-02-15 00:38:01,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:38:01" (4/4) ... [2022-02-15 00:38:01,455 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cJordan [2022-02-15 00:38:01,458 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:38:01,458 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:38:01,502 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:38:01,506 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 00:38:01,507 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:38:01,521 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-02-15 00:38:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 00:38:01,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:01,527 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-02-15 00:38:01,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-02-15 00:38:01,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:01,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057909749] [2022-02-15 00:38:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:01,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:01,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057909749] [2022-02-15 00:38:01,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057909749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:01,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:01,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:38:01,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689625633] [2022-02-15 00:38:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:01,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:38:01,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:38:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:38:01,915 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-02-15 00:38:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:02,911 INFO L93 Difference]: Finished difference Result 430 states and 602 transitions. [2022-02-15 00:38:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:38:02,913 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-02-15 00:38:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:02,922 INFO L225 Difference]: With dead ends: 430 [2022-02-15 00:38:02,923 INFO L226 Difference]: Without dead ends: 422 [2022-02-15 00:38:02,924 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-02-15 00:38:02,926 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-02-15 00:38:02,927 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-02-15 00:38:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-02-15 00:38:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-02-15 00:38:02,967 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-02-15 00:38:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-02-15 00:38:02,970 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-02-15 00:38:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:02,971 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-02-15 00:38:02,971 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-02-15 00:38:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-02-15 00:38:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 00:38:02,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:02,972 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-02-15 00:38:02,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:38:02,972 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-02-15 00:38:02,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:02,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935633119] [2022-02-15 00:38:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:03,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:03,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935633119] [2022-02-15 00:38:03,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935633119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:03,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:03,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:38:03,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136010940] [2022-02-15 00:38:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:03,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:38:03,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:38:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:38:03,143 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-02-15 00:38:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:03,959 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2022-02-15 00:38:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:38:03,960 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-02-15 00:38:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:03,963 INFO L225 Difference]: With dead ends: 585 [2022-02-15 00:38:03,963 INFO L226 Difference]: Without dead ends: 584 [2022-02-15 00:38:03,963 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-02-15 00:38:03,964 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 889 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:03,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [895 Valid, 891 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-02-15 00:38:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-02-15 00:38:03,985 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-02-15 00:38:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-02-15 00:38:03,987 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-02-15 00:38:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:03,987 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-02-15 00:38:03,988 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-02-15 00:38:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-02-15 00:38:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 00:38:03,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:03,989 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-02-15 00:38:03,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:38:03,989 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-02-15 00:38:03,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:03,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687518908] [2022-02-15 00:38:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:04,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:04,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687518908] [2022-02-15 00:38:04,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687518908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:04,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:04,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:38:04,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918194118] [2022-02-15 00:38:04,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:04,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:38:04,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:38:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:38:04,145 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-02-15 00:38:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:04,789 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2022-02-15 00:38:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:38:04,790 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-02-15 00:38:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:04,793 INFO L225 Difference]: With dead ends: 676 [2022-02-15 00:38:04,793 INFO L226 Difference]: Without dead ends: 676 [2022-02-15 00:38:04,793 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-02-15 00:38:04,794 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:04,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 603 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-15 00:38:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-02-15 00:38:04,811 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-02-15 00:38:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-02-15 00:38:04,813 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-02-15 00:38:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:04,813 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-02-15 00:38:04,813 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-02-15 00:38:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-02-15 00:38:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 00:38:04,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:04,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] [2022-02-15 00:38:04,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:38:04,815 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-02-15 00:38:04,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:04,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230149043] [2022-02-15 00:38:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:04,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:04,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230149043] [2022-02-15 00:38:04,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230149043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:04,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:04,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:38:04,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465787847] [2022-02-15 00:38:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:04,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:38:04,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:04,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:38:04,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:38:04,950 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-02-15 00:38:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:05,831 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2022-02-15 00:38:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:38:05,832 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-02-15 00:38:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:05,835 INFO L225 Difference]: With dead ends: 819 [2022-02-15 00:38:05,835 INFO L226 Difference]: Without dead ends: 819 [2022-02-15 00:38:05,836 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-02-15 00:38:05,836 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-02-15 00:38:05,837 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-02-15 00:38:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-02-15 00:38:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-02-15 00:38:05,853 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-02-15 00:38:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-02-15 00:38:05,856 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-02-15 00:38:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:05,856 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-02-15 00:38:05,856 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-02-15 00:38:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-02-15 00:38:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 00:38:05,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:05,858 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-02-15 00:38:05,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:38:05,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-02-15 00:38:05,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:05,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778540110] [2022-02-15 00:38:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:38:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:05,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:05,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778540110] [2022-02-15 00:38:05,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778540110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:05,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:05,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:05,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860193464] [2022-02-15 00:38:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:05,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:05,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:05,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:05,994 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-02-15 00:38:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:06,728 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2022-02-15 00:38:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:06,729 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-02-15 00:38:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:06,731 INFO L225 Difference]: With dead ends: 860 [2022-02-15 00:38:06,732 INFO L226 Difference]: Without dead ends: 860 [2022-02-15 00:38:06,732 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-02-15 00:38:06,732 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 839 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:06,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 807 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:38:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-15 00:38:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-02-15 00:38:06,748 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-02-15 00:38:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-02-15 00:38:06,751 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-02-15 00:38:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:06,752 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-02-15 00:38:06,752 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-02-15 00:38:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-02-15 00:38:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 00:38:06,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:06,754 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-02-15 00:38:06,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:38:06,754 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-02-15 00:38:06,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:06,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946527309] [2022-02-15 00:38:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:06,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:06,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946527309] [2022-02-15 00:38:06,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946527309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:06,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:06,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:38:06,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529402829] [2022-02-15 00:38:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:06,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:38:06,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:38:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:38:06,889 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-02-15 00:38:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:07,527 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2022-02-15 00:38:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:38:07,528 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-02-15 00:38:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:07,531 INFO L225 Difference]: With dead ends: 839 [2022-02-15 00:38:07,531 INFO L226 Difference]: Without dead ends: 839 [2022-02-15 00:38:07,531 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-02-15 00:38:07,531 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 488 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:07,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 719 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:38:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-02-15 00:38:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-02-15 00:38:07,544 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-02-15 00:38:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-02-15 00:38:07,547 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-02-15 00:38:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:07,547 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-02-15 00:38:07,547 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-02-15 00:38:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-02-15 00:38:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-15 00:38:07,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:07,548 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-02-15 00:38:07,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:38:07,548 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-02-15 00:38:07,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:07,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349597310] [2022-02-15 00:38:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:38:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:07,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:07,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349597310] [2022-02-15 00:38:07,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349597310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:07,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:07,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:07,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829966081] [2022-02-15 00:38:07,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:07,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:07,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:07,744 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-02-15 00:38:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:09,002 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2022-02-15 00:38:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:09,002 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-02-15 00:38:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:09,005 INFO L225 Difference]: With dead ends: 871 [2022-02-15 00:38:09,005 INFO L226 Difference]: Without dead ends: 871 [2022-02-15 00:38:09,005 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-02-15 00:38:09,006 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1244 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:09,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1048 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-15 00:38:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-02-15 00:38:09,019 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-02-15 00:38:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-02-15 00:38:09,021 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-02-15 00:38:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:09,021 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-02-15 00:38:09,021 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-02-15 00:38:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-02-15 00:38:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 00:38:09,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:09,022 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-02-15 00:38:09,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:38:09,023 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-02-15 00:38:09,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:09,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390267433] [2022-02-15 00:38:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:38:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:09,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:09,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390267433] [2022-02-15 00:38:09,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390267433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:09,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:09,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:09,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194740189] [2022-02-15 00:38:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:09,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:09,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:09,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:09,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:09,211 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-02-15 00:38:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:10,707 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2022-02-15 00:38:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:10,708 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-02-15 00:38:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:10,711 INFO L225 Difference]: With dead ends: 871 [2022-02-15 00:38:10,711 INFO L226 Difference]: Without dead ends: 871 [2022-02-15 00:38:10,711 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-02-15 00:38:10,711 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1592 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:10,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 1123 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 00:38:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-15 00:38:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-02-15 00:38:10,726 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-02-15 00:38:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-02-15 00:38:10,729 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-02-15 00:38:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:10,730 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-02-15 00:38:10,730 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-02-15 00:38:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-02-15 00:38:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 00:38:10,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:10,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] [2022-02-15 00:38:10,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:38:10,732 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-02-15 00:38:10,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:10,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42097223] [2022-02-15 00:38:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:38:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:10,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:10,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42097223] [2022-02-15 00:38:10,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42097223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:10,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:10,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:10,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024537682] [2022-02-15 00:38:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:10,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:10,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:10,864 INFO L87 Difference]: Start difference. First operand 819 states and 1102 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-02-15 00:38:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:11,879 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2022-02-15 00:38:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:38:11,879 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-02-15 00:38:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:11,882 INFO L225 Difference]: With dead ends: 879 [2022-02-15 00:38:11,882 INFO L226 Difference]: Without dead ends: 867 [2022-02-15 00:38:11,882 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-02-15 00:38:11,883 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 475 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:11,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1371 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-02-15 00:38:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-02-15 00:38:11,894 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-02-15 00:38:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-02-15 00:38:11,896 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2022-02-15 00:38:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:11,897 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-02-15 00:38:11,897 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-02-15 00:38:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-02-15 00:38:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 00:38:11,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:11,898 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-02-15 00:38:11,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:38:11,898 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-02-15 00:38:11,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:11,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369604061] [2022-02-15 00:38:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:38:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:12,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:12,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369604061] [2022-02-15 00:38:12,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369604061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:12,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:12,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:12,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062768395] [2022-02-15 00:38:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:12,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:12,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:12,043 INFO L87 Difference]: Start difference. First operand 817 states and 1098 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-02-15 00:38:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:13,354 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2022-02-15 00:38:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:38:13,354 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-02-15 00:38:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:13,357 INFO L225 Difference]: With dead ends: 877 [2022-02-15 00:38:13,357 INFO L226 Difference]: Without dead ends: 860 [2022-02-15 00:38:13,357 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-02-15 00:38:13,357 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 319 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:13,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1413 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 00:38:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-15 00:38:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-02-15 00:38:13,371 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-02-15 00:38:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-02-15 00:38:13,373 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2022-02-15 00:38:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:13,373 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-02-15 00:38:13,373 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-02-15 00:38:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-02-15 00:38:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 00:38:13,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:13,375 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-02-15 00:38:13,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:38:13,375 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-02-15 00:38:13,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:13,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076178059] [2022-02-15 00:38:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:13,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:13,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076178059] [2022-02-15 00:38:13,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076178059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:13,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:13,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:13,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442872399] [2022-02-15 00:38:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:13,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:13,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:13,508 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-02-15 00:38:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:14,508 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2022-02-15 00:38:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:14,508 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-02-15 00:38:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:14,512 INFO L225 Difference]: With dead ends: 835 [2022-02-15 00:38:14,512 INFO L226 Difference]: Without dead ends: 835 [2022-02-15 00:38:14,513 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-02-15 00:38:14,513 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 547 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:14,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1012 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-02-15 00:38:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-02-15 00:38:14,524 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-02-15 00:38:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-02-15 00:38:14,527 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-02-15 00:38:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:14,527 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-02-15 00:38:14,527 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-02-15 00:38:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-02-15 00:38:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 00:38:14,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:14,528 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-02-15 00:38:14,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:38:14,528 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-02-15 00:38:14,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:14,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417492267] [2022-02-15 00:38:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:14,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:38:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:14,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:14,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417492267] [2022-02-15 00:38:14,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417492267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:14,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:14,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 00:38:14,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282640375] [2022-02-15 00:38:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:14,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:38:14,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:14,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:38:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:38:14,661 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-02-15 00:38:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:15,657 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2022-02-15 00:38:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:15,657 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-02-15 00:38:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:15,659 INFO L225 Difference]: With dead ends: 840 [2022-02-15 00:38:15,660 INFO L226 Difference]: Without dead ends: 840 [2022-02-15 00:38:15,660 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-02-15 00:38:15,660 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 526 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:15,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 912 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-02-15 00:38:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-02-15 00:38:15,674 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-02-15 00:38:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-02-15 00:38:15,676 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-02-15 00:38:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:15,676 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-02-15 00:38:15,676 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-02-15 00:38:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-02-15 00:38:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-15 00:38:15,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:15,677 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-02-15 00:38:15,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:38:15,677 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-02-15 00:38:15,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:15,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052649785] [2022-02-15 00:38:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:15,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:15,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:15,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052649785] [2022-02-15 00:38:15,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052649785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:15,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:15,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:15,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863935802] [2022-02-15 00:38:15,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:15,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:15,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:15,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:15,815 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-02-15 00:38:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:16,851 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2022-02-15 00:38:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:38:16,851 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-02-15 00:38:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:16,853 INFO L225 Difference]: With dead ends: 838 [2022-02-15 00:38:16,854 INFO L226 Difference]: Without dead ends: 838 [2022-02-15 00:38:16,854 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-02-15 00:38:16,854 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 535 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:16,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 1029 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-02-15 00:38:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-02-15 00:38:16,866 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-02-15 00:38:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-02-15 00:38:16,868 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-02-15 00:38:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:16,884 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-02-15 00:38:16,884 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-02-15 00:38:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-02-15 00:38:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 00:38:16,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:16,885 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-02-15 00:38:16,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:38:16,885 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-02-15 00:38:16,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:16,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168724626] [2022-02-15 00:38:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:17,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:17,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168724626] [2022-02-15 00:38:17,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168724626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:17,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:17,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:17,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094423255] [2022-02-15 00:38:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:17,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:17,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:17,063 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-02-15 00:38:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:17,823 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2022-02-15 00:38:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:17,824 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-02-15 00:38:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:17,826 INFO L225 Difference]: With dead ends: 858 [2022-02-15 00:38:17,826 INFO L226 Difference]: Without dead ends: 843 [2022-02-15 00:38:17,826 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-02-15 00:38:17,827 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 689 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:17,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 1265 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-15 00:38:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-02-15 00:38:17,853 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-02-15 00:38:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-02-15 00:38:17,855 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-02-15 00:38:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:17,855 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-02-15 00:38:17,856 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-02-15 00:38:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-02-15 00:38:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 00:38:17,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:17,856 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-02-15 00:38:17,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:38:17,857 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-02-15 00:38:17,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:17,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288141078] [2022-02-15 00:38:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:17,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:17,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288141078] [2022-02-15 00:38:17,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288141078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:17,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:17,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:17,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132111858] [2022-02-15 00:38:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:17,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:17,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:17,983 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-02-15 00:38:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:18,917 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2022-02-15 00:38:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:38:18,917 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-02-15 00:38:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:18,920 INFO L225 Difference]: With dead ends: 855 [2022-02-15 00:38:18,920 INFO L226 Difference]: Without dead ends: 804 [2022-02-15 00:38:18,920 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-02-15 00:38:18,920 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 845 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:18,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 827 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-02-15 00:38:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-02-15 00:38:18,933 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-02-15 00:38:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-02-15 00:38:18,935 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-02-15 00:38:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:18,935 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-02-15 00:38:18,935 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-02-15 00:38:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-02-15 00:38:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 00:38:18,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:18,937 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-02-15 00:38:18,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:38:18,937 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-02-15 00:38:18,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:18,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101278912] [2022-02-15 00:38:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:38:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:19,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:19,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101278912] [2022-02-15 00:38:19,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101278912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:19,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:19,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 00:38:19,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503748718] [2022-02-15 00:38:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:19,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 00:38:19,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:19,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 00:38:19,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:38:19,036 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-02-15 00:38:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:20,131 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2022-02-15 00:38:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:20,131 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-02-15 00:38:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:20,134 INFO L225 Difference]: With dead ends: 1131 [2022-02-15 00:38:20,134 INFO L226 Difference]: Without dead ends: 1131 [2022-02-15 00:38:20,134 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-02-15 00:38:20,135 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 490 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:20,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 766 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:38:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-02-15 00:38:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-02-15 00:38:20,148 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-02-15 00:38:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-02-15 00:38:20,154 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-02-15 00:38:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:20,154 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-02-15 00:38:20,154 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-02-15 00:38:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-02-15 00:38:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 00:38:20,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:20,155 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-02-15 00:38:20,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:38:20,155 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-02-15 00:38:20,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:20,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275220905] [2022-02-15 00:38:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:20,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:20,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275220905] [2022-02-15 00:38:20,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275220905] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:20,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:20,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:20,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938984212] [2022-02-15 00:38:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:20,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:20,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:20,295 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-02-15 00:38:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:21,230 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2022-02-15 00:38:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:38:21,230 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-02-15 00:38:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:21,233 INFO L225 Difference]: With dead ends: 930 [2022-02-15 00:38:21,233 INFO L226 Difference]: Without dead ends: 915 [2022-02-15 00:38:21,233 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-02-15 00:38:21,234 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 556 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:21,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1276 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-02-15 00:38:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-02-15 00:38:21,246 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-02-15 00:38:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-02-15 00:38:21,248 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-02-15 00:38:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:21,248 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-02-15 00:38:21,248 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-02-15 00:38:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-02-15 00:38:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-15 00:38:21,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:21,249 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-02-15 00:38:21,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:38:21,249 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-02-15 00:38:21,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:21,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614547044] [2022-02-15 00:38:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:38:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:21,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:21,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614547044] [2022-02-15 00:38:21,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614547044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:21,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:21,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:21,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528651411] [2022-02-15 00:38:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:21,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:21,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:21,433 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-02-15 00:38:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:22,586 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2022-02-15 00:38:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:22,586 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-02-15 00:38:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:22,589 INFO L225 Difference]: With dead ends: 936 [2022-02-15 00:38:22,589 INFO L226 Difference]: Without dead ends: 936 [2022-02-15 00:38:22,589 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-02-15 00:38:22,590 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1467 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:22,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1479 Valid, 837 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:38:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-02-15 00:38:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-02-15 00:38:22,601 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-02-15 00:38:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-02-15 00:38:22,602 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-02-15 00:38:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-02-15 00:38:22,603 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-02-15 00:38:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-02-15 00:38:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 00:38:22,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:22,604 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-02-15 00:38:22,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 00:38:22,604 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-02-15 00:38:22,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:22,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124642010] [2022-02-15 00:38:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:22,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:22,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124642010] [2022-02-15 00:38:22,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124642010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:22,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:22,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:22,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383698567] [2022-02-15 00:38:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:22,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:22,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:22,781 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-02-15 00:38:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:24,365 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2022-02-15 00:38:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 00:38:24,366 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-02-15 00:38:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:24,369 INFO L225 Difference]: With dead ends: 1075 [2022-02-15 00:38:24,369 INFO L226 Difference]: Without dead ends: 1075 [2022-02-15 00:38:24,369 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-02-15 00:38:24,370 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 1391 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:24,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1394 Valid, 1457 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 00:38:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-02-15 00:38:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-02-15 00:38:24,382 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-02-15 00:38:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-02-15 00:38:24,384 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-02-15 00:38:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:24,384 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-02-15 00:38:24,384 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-02-15 00:38:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-02-15 00:38:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 00:38:24,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:24,385 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-02-15 00:38:24,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:38:24,385 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-02-15 00:38:24,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:24,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657182214] [2022-02-15 00:38:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-15 00:38:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:24,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:24,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657182214] [2022-02-15 00:38:24,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657182214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:24,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:24,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:38:24,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642314356] [2022-02-15 00:38:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:24,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:38:24,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:38:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:38:24,552 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-02-15 00:38:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:25,526 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2022-02-15 00:38:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:25,527 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-02-15 00:38:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:25,529 INFO L225 Difference]: With dead ends: 976 [2022-02-15 00:38:25,529 INFO L226 Difference]: Without dead ends: 959 [2022-02-15 00:38:25,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:25,530 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 478 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:25,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1462 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-02-15 00:38:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-02-15 00:38:25,542 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-02-15 00:38:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-02-15 00:38:25,543 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-02-15 00:38:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:25,543 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-02-15 00:38:25,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-02-15 00:38:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-02-15 00:38:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:38:25,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:25,547 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-02-15 00:38:25,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 00:38:25,548 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-02-15 00:38:25,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:25,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199665428] [2022-02-15 00:38:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:25,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:25,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-15 00:38:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:25,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:25,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199665428] [2022-02-15 00:38:25,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199665428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:25,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:25,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:25,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471302547] [2022-02-15 00:38:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:25,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:25,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:25,674 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-02-15 00:38:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:26,539 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2022-02-15 00:38:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:38:26,539 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-02-15 00:38:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:26,541 INFO L225 Difference]: With dead ends: 685 [2022-02-15 00:38:26,541 INFO L226 Difference]: Without dead ends: 685 [2022-02-15 00:38:26,541 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-02-15 00:38:26,543 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 850 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:26,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 830 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-02-15 00:38:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-02-15 00:38:26,552 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-02-15 00:38:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-02-15 00:38:26,553 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-02-15 00:38:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:26,553 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-02-15 00:38:26,553 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-02-15 00:38:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-02-15 00:38:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 00:38:26,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:26,554 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-02-15 00:38:26,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:38:26,554 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-02-15 00:38:26,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:26,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583331130] [2022-02-15 00:38:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:26,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:26,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583331130] [2022-02-15 00:38:26,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583331130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:26,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:26,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:38:26,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152363527] [2022-02-15 00:38:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:26,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:38:26,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:38:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:38:26,745 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), 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-02-15 00:38:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:27,745 INFO L93 Difference]: Finished difference Result 670 states and 845 transitions. [2022-02-15 00:38:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:27,745 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-02-15 00:38:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:27,747 INFO L225 Difference]: With dead ends: 670 [2022-02-15 00:38:27,747 INFO L226 Difference]: Without dead ends: 645 [2022-02-15 00:38:27,747 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-02-15 00:38:27,748 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 447 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:27,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 1493 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-15 00:38:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-02-15 00:38:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 488 states have (on average 1.2704918032786885) internal successors, (620), 499 states have internal predecessors, (620), 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-02-15 00:38:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-02-15 00:38:27,756 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-02-15 00:38:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:27,756 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-02-15 00:38:27,756 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-02-15 00:38:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-02-15 00:38:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 00:38:27,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:27,758 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-02-15 00:38:27,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:38:27,758 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-02-15 00:38:27,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:27,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136551847] [2022-02-15 00:38:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:27,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:27,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136551847] [2022-02-15 00:38:27,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136551847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:27,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:27,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:38:27,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482573054] [2022-02-15 00:38:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:27,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:38:27,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:38:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:38:27,900 INFO L87 Difference]: Start difference. First operand 613 states and 776 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-02-15 00:38:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:28,737 INFO L93 Difference]: Finished difference Result 647 states and 817 transitions. [2022-02-15 00:38:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:38:28,737 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-02-15 00:38:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:28,739 INFO L225 Difference]: With dead ends: 647 [2022-02-15 00:38:28,739 INFO L226 Difference]: Without dead ends: 647 [2022-02-15 00:38:28,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:28,739 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 469 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:28,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 1052 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:38:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-02-15 00:38:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-02-15 00:38:28,746 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-02-15 00:38:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-02-15 00:38:28,747 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-02-15 00:38:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:28,747 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-02-15 00:38:28,747 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-02-15 00:38:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-02-15 00:38:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:38:28,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:28,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:38:28,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 00:38:28,748 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-02-15 00:38:28,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:28,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217792353] [2022-02-15 00:38:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:28,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:28,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217792353] [2022-02-15 00:38:28,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217792353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:28,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:28,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:28,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125679332] [2022-02-15 00:38:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:28,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:28,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:28,899 INFO L87 Difference]: Start difference. First operand 616 states and 779 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-02-15 00:38:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:29,747 INFO L93 Difference]: Finished difference Result 677 states and 864 transitions. [2022-02-15 00:38:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:38:29,748 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-02-15 00:38:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:29,750 INFO L225 Difference]: With dead ends: 677 [2022-02-15 00:38:29,750 INFO L226 Difference]: Without dead ends: 676 [2022-02-15 00:38:29,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:29,750 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1159 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:29,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 800 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-15 00:38:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-02-15 00:38:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 502 states have (on average 1.2729083665338645) internal successors, (639), 512 states have internal predecessors, (639), 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-02-15 00:38:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-02-15 00:38:29,758 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-02-15 00:38:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:29,758 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-02-15 00:38:29,758 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-02-15 00:38:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-02-15 00:38:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:38:29,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:29,759 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-02-15 00:38:29,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 00:38:29,759 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-02-15 00:38:29,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:29,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491210836] [2022-02-15 00:38:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:29,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:29,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491210836] [2022-02-15 00:38:29,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491210836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:29,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:29,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:29,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024495751] [2022-02-15 00:38:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:29,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:29,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:29,937 INFO L87 Difference]: Start difference. First operand 627 states and 795 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-02-15 00:38:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:31,208 INFO L93 Difference]: Finished difference Result 670 states and 844 transitions. [2022-02-15 00:38:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:38:31,209 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-02-15 00:38:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:31,211 INFO L225 Difference]: With dead ends: 670 [2022-02-15 00:38:31,211 INFO L226 Difference]: Without dead ends: 670 [2022-02-15 00:38:31,212 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-02-15 00:38:31,215 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 766 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:31,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1152 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:38:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-02-15 00:38:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-02-15 00:38:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 495 states have (on average 1.2686868686868686) internal successors, (628), 505 states have internal predecessors, (628), 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-02-15 00:38:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-02-15 00:38:31,223 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-02-15 00:38:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:31,224 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-02-15 00:38:31,224 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-02-15 00:38:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-02-15 00:38:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:38:31,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:31,224 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-02-15 00:38:31,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 00:38:31,225 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-02-15 00:38:31,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:31,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832493599] [2022-02-15 00:38:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:31,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:31,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832493599] [2022-02-15 00:38:31,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832493599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:31,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:31,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:31,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163292012] [2022-02-15 00:38:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:31,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:31,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:31,397 INFO L87 Difference]: Start difference. First operand 620 states and 784 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-02-15 00:38:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:32,068 INFO L93 Difference]: Finished difference Result 800 states and 1032 transitions. [2022-02-15 00:38:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:32,068 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-02-15 00:38:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:32,070 INFO L225 Difference]: With dead ends: 800 [2022-02-15 00:38:32,070 INFO L226 Difference]: Without dead ends: 738 [2022-02-15 00:38:32,070 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-02-15 00:38:32,071 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 640 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:32,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 908 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:38:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-02-15 00:38:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-02-15 00:38:32,085 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-02-15 00:38:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-02-15 00:38:32,091 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-02-15 00:38:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:32,091 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-02-15 00:38:32,092 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-02-15 00:38:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-02-15 00:38:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 00:38:32,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:32,093 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-02-15 00:38:32,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 00:38:32,093 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-02-15 00:38:32,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:32,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074708883] [2022-02-15 00:38:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:32,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:32,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074708883] [2022-02-15 00:38:32,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074708883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:32,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:32,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:32,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841533181] [2022-02-15 00:38:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:32,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:32,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:32,287 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-02-15 00:38:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:33,431 INFO L93 Difference]: Finished difference Result 635 states and 815 transitions. [2022-02-15 00:38:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:33,431 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-02-15 00:38:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:33,439 INFO L225 Difference]: With dead ends: 635 [2022-02-15 00:38:33,439 INFO L226 Difference]: Without dead ends: 634 [2022-02-15 00:38:33,440 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-02-15 00:38:33,440 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 270 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:33,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1778 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-15 00:38:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-02-15 00:38:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-02-15 00:38:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 470 states have (on average 1.2659574468085106) internal successors, (595), 480 states have internal predecessors, (595), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (91), 68 states have call predecessors, (91), 61 states have call successors, (91) [2022-02-15 00:38:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-02-15 00:38:33,447 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-02-15 00:38:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:33,447 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-02-15 00:38:33,447 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-02-15 00:38:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-02-15 00:38:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 00:38:33,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:33,448 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-02-15 00:38:33,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 00:38:33,448 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-02-15 00:38:33,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:33,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324318005] [2022-02-15 00:38:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:33,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:33,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324318005] [2022-02-15 00:38:33,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324318005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:33,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:33,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:33,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389636462] [2022-02-15 00:38:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:33,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:33,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:33,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:33,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:33,611 INFO L87 Difference]: Start difference. First operand 592 states and 755 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-02-15 00:38:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:34,504 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2022-02-15 00:38:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:34,505 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-02-15 00:38:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:34,506 INFO L225 Difference]: With dead ends: 623 [2022-02-15 00:38:34,506 INFO L226 Difference]: Without dead ends: 611 [2022-02-15 00:38:34,507 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-02-15 00:38:34,507 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 378 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:34,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1676 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-02-15 00:38:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-02-15 00:38:34,513 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-02-15 00:38:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-02-15 00:38:34,514 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-02-15 00:38:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:34,514 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-02-15 00:38:34,514 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-02-15 00:38:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-02-15 00:38:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-15 00:38:34,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:34,515 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-02-15 00:38:34,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 00:38:34,515 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-02-15 00:38:34,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:34,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319361540] [2022-02-15 00:38:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:34,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:34,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319361540] [2022-02-15 00:38:34,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319361540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:34,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:34,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:34,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090690935] [2022-02-15 00:38:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:34,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:34,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:34,715 INFO L87 Difference]: Start difference. First operand 589 states and 751 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-02-15 00:38:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:35,782 INFO L93 Difference]: Finished difference Result 621 states and 787 transitions. [2022-02-15 00:38:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:35,796 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-02-15 00:38:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:35,798 INFO L225 Difference]: With dead ends: 621 [2022-02-15 00:38:35,798 INFO L226 Difference]: Without dead ends: 596 [2022-02-15 00:38:35,798 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-02-15 00:38:35,803 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 365 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:35,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1728 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:38:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-02-15 00:38:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-02-15 00:38:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 458 states have (on average 1.2663755458515285) internal successors, (580), 469 states have internal predecessors, (580), 67 states have call successors, (67), 43 states have call predecessors, (67), 51 states have return successors, (88), 65 states have call predecessors, (88), 59 states have call successors, (88) [2022-02-15 00:38:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-02-15 00:38:35,822 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-02-15 00:38:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:35,822 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-02-15 00:38:35,822 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-02-15 00:38:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-02-15 00:38:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-15 00:38:35,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:35,823 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-02-15 00:38:35,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 00:38:35,823 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-02-15 00:38:35,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:35,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449902786] [2022-02-15 00:38:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:35,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:36,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:36,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449902786] [2022-02-15 00:38:36,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449902786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:36,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:36,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:36,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112966509] [2022-02-15 00:38:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:36,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:36,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:36,043 INFO L87 Difference]: Start difference. First operand 577 states and 735 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-02-15 00:38:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:37,233 INFO L93 Difference]: Finished difference Result 742 states and 964 transitions. [2022-02-15 00:38:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:38:37,234 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-02-15 00:38:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:37,236 INFO L225 Difference]: With dead ends: 742 [2022-02-15 00:38:37,236 INFO L226 Difference]: Without dead ends: 728 [2022-02-15 00:38:37,236 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-02-15 00:38:37,236 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 879 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:37,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 972 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-02-15 00:38:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-02-15 00:38:37,244 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-02-15 00:38:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-02-15 00:38:37,252 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-02-15 00:38:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:37,252 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-02-15 00:38:37,252 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-02-15 00:38:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-02-15 00:38:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 00:38:37,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:37,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:38:37,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 00:38:37,253 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-02-15 00:38:37,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:37,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321754820] [2022-02-15 00:38:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 00:38:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-15 00:38:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:37,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:37,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321754820] [2022-02-15 00:38:37,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321754820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:37,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:37,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:38:37,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335633274] [2022-02-15 00:38:37,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:37,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:38:37,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:38:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:38:37,368 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:38:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:37,943 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2022-02-15 00:38:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:38:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-02-15 00:38:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:37,945 INFO L225 Difference]: With dead ends: 589 [2022-02-15 00:38:37,945 INFO L226 Difference]: Without dead ends: 589 [2022-02-15 00:38:37,945 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-02-15 00:38:37,945 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 624 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:37,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 772 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-02-15 00:38:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-02-15 00:38:37,951 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-02-15 00:38:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-02-15 00:38:37,952 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-02-15 00:38:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:37,952 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-02-15 00:38:37,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:38:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-02-15 00:38:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 00:38:37,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:37,953 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-02-15 00:38:37,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 00:38:37,954 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-02-15 00:38:37,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:37,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212156672] [2022-02-15 00:38:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-15 00:38:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:38,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:38,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212156672] [2022-02-15 00:38:38,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212156672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:38,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:38,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:38,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452090237] [2022-02-15 00:38:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:38,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:38,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:38,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:38,134 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-02-15 00:38:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:38,807 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2022-02-15 00:38:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:38,808 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-02-15 00:38:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:38,809 INFO L225 Difference]: With dead ends: 538 [2022-02-15 00:38:38,809 INFO L226 Difference]: Without dead ends: 538 [2022-02-15 00:38:38,809 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-02-15 00:38:38,810 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 556 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:38,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1124 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-02-15 00:38:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-02-15 00:38:38,814 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-02-15 00:38:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-02-15 00:38:38,815 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-02-15 00:38:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:38,815 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-02-15 00:38:38,815 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-02-15 00:38:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-02-15 00:38:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 00:38:38,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:38,816 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-02-15 00:38:38,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 00:38:38,816 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-02-15 00:38:38,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:38,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887152351] [2022-02-15 00:38:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 00:38:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:39,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:39,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887152351] [2022-02-15 00:38:39,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887152351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:39,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:39,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:39,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195399517] [2022-02-15 00:38:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:39,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:39,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:39,001 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-02-15 00:38:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:40,155 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2022-02-15 00:38:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:38:40,156 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-02-15 00:38:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:40,157 INFO L225 Difference]: With dead ends: 542 [2022-02-15 00:38:40,157 INFO L226 Difference]: Without dead ends: 524 [2022-02-15 00:38:40,158 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-02-15 00:38:40,158 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 575 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:40,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1192 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:38:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-15 00:38:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-02-15 00:38:40,163 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-02-15 00:38:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-02-15 00:38:40,163 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-02-15 00:38:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:40,164 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-02-15 00:38:40,164 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-02-15 00:38:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-02-15 00:38:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 00:38:40,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:40,165 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-02-15 00:38:40,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 00:38:40,165 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-02-15 00:38:40,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:40,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100437951] [2022-02-15 00:38:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-15 00:38:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:40,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:40,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100437951] [2022-02-15 00:38:40,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100437951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:40,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:40,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:40,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778647044] [2022-02-15 00:38:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:40,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:40,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:40,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:40,331 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-02-15 00:38:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:41,173 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2022-02-15 00:38:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:38:41,175 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-02-15 00:38:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:41,180 INFO L225 Difference]: With dead ends: 535 [2022-02-15 00:38:41,180 INFO L226 Difference]: Without dead ends: 520 [2022-02-15 00:38:41,181 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-02-15 00:38:41,181 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 487 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:41,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1547 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:38:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-15 00:38:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-02-15 00:38:41,187 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-02-15 00:38:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-02-15 00:38:41,187 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-02-15 00:38:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:41,188 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-02-15 00:38:41,188 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-02-15 00:38:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-02-15 00:38:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-15 00:38:41,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-15 00:38:41,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 00:38:41,189 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-02-15 00:38:41,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:41,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599988385] [2022-02-15 00:38:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-15 00:38:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:41,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:41,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599988385] [2022-02-15 00:38:41,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599988385] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:41,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:41,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:41,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643575352] [2022-02-15 00:38:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:41,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:41,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:41,380 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-02-15 00:38:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:42,518 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2022-02-15 00:38:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:42,519 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-02-15 00:38:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:42,527 INFO L225 Difference]: With dead ends: 536 [2022-02-15 00:38:42,527 INFO L226 Difference]: Without dead ends: 515 [2022-02-15 00:38:42,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:42,528 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:42,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 877 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-15 00:38:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-15 00:38:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-02-15 00:38:42,535 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-02-15 00:38:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-02-15 00:38:42,536 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-02-15 00:38:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:42,536 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-02-15 00:38:42,536 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-02-15 00:38:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-02-15 00:38:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-15 00:38:42,537 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:42,537 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-02-15 00:38:42,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 00:38:42,537 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-02-15 00:38:42,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:42,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221941906] [2022-02-15 00:38:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-15 00:38:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:42,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:42,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221941906] [2022-02-15 00:38:42,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221941906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:42,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:42,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:42,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409878309] [2022-02-15 00:38:42,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:42,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:42,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:42,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:42,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:42,715 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-02-15 00:38:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:43,301 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2022-02-15 00:38:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:43,301 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-02-15 00:38:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:43,303 INFO L225 Difference]: With dead ends: 521 [2022-02-15 00:38:43,303 INFO L226 Difference]: Without dead ends: 521 [2022-02-15 00:38:43,303 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-02-15 00:38:43,303 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 757 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:43,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1011 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-02-15 00:38:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-02-15 00:38:43,326 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-02-15 00:38:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-02-15 00:38:43,327 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-02-15 00:38:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:43,327 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-02-15 00:38:43,327 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-02-15 00:38:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-02-15 00:38:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 00:38:43,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:43,328 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-02-15 00:38:43,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 00:38:43,329 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-02-15 00:38:43,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:43,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153345983] [2022-02-15 00:38:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:43,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:43,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153345983] [2022-02-15 00:38:43,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153345983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:43,489 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:43,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:38:43,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346057161] [2022-02-15 00:38:43,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:43,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:38:43,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:38:43,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:38:43,491 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-02-15 00:38:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:44,477 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2022-02-15 00:38:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:38:44,478 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-02-15 00:38:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:44,479 INFO L225 Difference]: With dead ends: 519 [2022-02-15 00:38:44,479 INFO L226 Difference]: Without dead ends: 519 [2022-02-15 00:38:44,479 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-02-15 00:38:44,481 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 321 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:44,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 754 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-15 00:38:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-02-15 00:38:44,486 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-02-15 00:38:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-02-15 00:38:44,487 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-02-15 00:38:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:44,487 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-02-15 00:38:44,487 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-02-15 00:38:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-02-15 00:38:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 00:38:44,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:44,490 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-02-15 00:38:44,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 00:38:44,490 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-02-15 00:38:44,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:44,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360638342] [2022-02-15 00:38:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:44,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:44,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360638342] [2022-02-15 00:38:44,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360638342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:44,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:44,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:44,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961879727] [2022-02-15 00:38:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:44,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:44,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:44,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:44,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:44,691 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-02-15 00:38:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:45,736 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2022-02-15 00:38:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:45,737 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-02-15 00:38:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:45,738 INFO L225 Difference]: With dead ends: 505 [2022-02-15 00:38:45,738 INFO L226 Difference]: Without dead ends: 505 [2022-02-15 00:38:45,738 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-02-15 00:38:45,739 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 671 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:45,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 972 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-15 00:38:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-02-15 00:38:45,744 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-02-15 00:38:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-02-15 00:38:45,744 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-02-15 00:38:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:45,745 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-02-15 00:38:45,745 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-02-15 00:38:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-02-15 00:38:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-15 00:38:45,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:45,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-15 00:38:45,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 00:38:45,748 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-02-15 00:38:45,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:45,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108862792] [2022-02-15 00:38:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-15 00:38:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:45,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:45,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108862792] [2022-02-15 00:38:45,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108862792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:45,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:45,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:38:45,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647691227] [2022-02-15 00:38:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:45,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:38:45,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:38:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:38:45,966 INFO L87 Difference]: Start difference. First operand 489 states and 604 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-02-15 00:38:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:46,747 INFO L93 Difference]: Finished difference Result 524 states and 652 transitions. [2022-02-15 00:38:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 00:38:46,747 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-02-15 00:38:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:46,748 INFO L225 Difference]: With dead ends: 524 [2022-02-15 00:38:46,748 INFO L226 Difference]: Without dead ends: 524 [2022-02-15 00:38:46,748 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-02-15 00:38:46,749 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 556 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:46,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1315 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-15 00:38:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-02-15 00:38:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.234375) internal successors, (474), 391 states have internal predecessors, (474), 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-02-15 00:38:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-02-15 00:38:46,754 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-02-15 00:38:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:46,754 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-02-15 00:38:46,754 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-02-15 00:38:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-02-15 00:38:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 00:38:46,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:46,755 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-02-15 00:38:46,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 00:38:46,755 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-02-15 00:38:46,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:46,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696512692] [2022-02-15 00:38:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:46,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:46,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696512692] [2022-02-15 00:38:46,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696512692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:46,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:46,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:46,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721354705] [2022-02-15 00:38:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:46,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:46,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:46,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:46,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:46,926 INFO L87 Difference]: Start difference. First operand 489 states and 602 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-02-15 00:38:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:47,844 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2022-02-15 00:38:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:47,845 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-02-15 00:38:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:47,846 INFO L225 Difference]: With dead ends: 519 [2022-02-15 00:38:47,846 INFO L226 Difference]: Without dead ends: 501 [2022-02-15 00:38:47,846 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-02-15 00:38:47,846 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 357 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:47,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1611 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-02-15 00:38:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-02-15 00:38:47,851 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-02-15 00:38:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-02-15 00:38:47,851 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-02-15 00:38:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:47,851 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-02-15 00:38:47,852 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-02-15 00:38:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-02-15 00:38:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 00:38:47,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:47,853 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-02-15 00:38:47,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 00:38:47,854 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-02-15 00:38:47,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:47,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238512297] [2022-02-15 00:38:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 00:38:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:48,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:48,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238512297] [2022-02-15 00:38:48,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238512297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:48,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:48,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:48,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85511154] [2022-02-15 00:38:48,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:48,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:48,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:48,003 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-02-15 00:38:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:48,638 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2022-02-15 00:38:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:48,639 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-02-15 00:38:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:48,640 INFO L225 Difference]: With dead ends: 509 [2022-02-15 00:38:48,640 INFO L226 Difference]: Without dead ends: 490 [2022-02-15 00:38:48,640 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-02-15 00:38:48,645 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 315 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:48,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1452 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:38:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-02-15 00:38:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-02-15 00:38:48,668 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-02-15 00:38:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-02-15 00:38:48,669 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-02-15 00:38:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:48,669 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-02-15 00:38:48,669 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-02-15 00:38:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-02-15 00:38:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 00:38:48,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:48,670 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-02-15 00:38:48,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 00:38:48,670 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-02-15 00:38:48,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:48,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220305636] [2022-02-15 00:38:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:48,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:48,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220305636] [2022-02-15 00:38:48,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220305636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:48,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:48,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:48,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654024135] [2022-02-15 00:38:48,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:48,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:48,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:48,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:48,824 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-02-15 00:38:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:49,709 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2022-02-15 00:38:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:49,710 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-02-15 00:38:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:49,711 INFO L225 Difference]: With dead ends: 504 [2022-02-15 00:38:49,711 INFO L226 Difference]: Without dead ends: 485 [2022-02-15 00:38:49,711 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-02-15 00:38:49,712 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 293 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:49,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1681 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-15 00:38:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-02-15 00:38:49,716 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-02-15 00:38:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-02-15 00:38:49,717 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-02-15 00:38:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:49,717 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-02-15 00:38:49,717 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-02-15 00:38:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-02-15 00:38:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 00:38:49,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:49,724 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-02-15 00:38:49,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 00:38:49,725 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-02-15 00:38:49,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:49,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629631335] [2022-02-15 00:38:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:49,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:49,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629631335] [2022-02-15 00:38:49,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629631335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:49,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:49,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:49,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848460875] [2022-02-15 00:38:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:49,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:49,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:49,893 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-02-15 00:38:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:50,392 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2022-02-15 00:38:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:50,392 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-02-15 00:38:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:50,394 INFO L225 Difference]: With dead ends: 499 [2022-02-15 00:38:50,394 INFO L226 Difference]: Without dead ends: 481 [2022-02-15 00:38:50,394 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-02-15 00:38:50,401 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:50,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1473 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-15 00:38:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-02-15 00:38:50,409 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-02-15 00:38:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-02-15 00:38:50,411 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-02-15 00:38:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:50,412 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-02-15 00:38:50,412 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-02-15 00:38:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-02-15 00:38:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-15 00:38:50,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:50,413 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] [2022-02-15 00:38:50,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 00:38:50,413 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-02-15 00:38:50,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:50,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915339357] [2022-02-15 00:38:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-15 00:38:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:50,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:50,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915339357] [2022-02-15 00:38:50,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915339357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:50,548 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:50,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 00:38:50,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005783961] [2022-02-15 00:38:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:50,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:38:50,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:38:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:38:50,549 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:38:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:51,167 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2022-02-15 00:38:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:38:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-02-15 00:38:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:51,168 INFO L225 Difference]: With dead ends: 625 [2022-02-15 00:38:51,168 INFO L226 Difference]: Without dead ends: 625 [2022-02-15 00:38:51,168 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-02-15 00:38:51,169 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 879 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:51,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 918 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-02-15 00:38:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-02-15 00:38:51,173 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-02-15 00:38:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-02-15 00:38:51,174 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-02-15 00:38:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:51,174 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-02-15 00:38:51,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:38:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-02-15 00:38:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-15 00:38:51,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:51,176 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-02-15 00:38:51,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-15 00:38:51,176 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-02-15 00:38:51,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:51,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137709916] [2022-02-15 00:38:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-15 00:38:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:51,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-02-15 00:38:51,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:51,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137709916] [2022-02-15 00:38:51,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137709916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:51,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:51,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:51,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202542954] [2022-02-15 00:38:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:51,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:51,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:51,362 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-02-15 00:38:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:52,280 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2022-02-15 00:38:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:38:52,280 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-02-15 00:38:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:52,282 INFO L225 Difference]: With dead ends: 616 [2022-02-15 00:38:52,282 INFO L226 Difference]: Without dead ends: 576 [2022-02-15 00:38:52,282 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-02-15 00:38:52,282 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 402 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:52,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1438 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-15 00:38:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-02-15 00:38:52,287 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-02-15 00:38:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-02-15 00:38:52,288 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-02-15 00:38:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:52,288 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-02-15 00:38:52,288 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-02-15 00:38:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-02-15 00:38:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-15 00:38:52,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:52,289 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-02-15 00:38:52,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 00:38:52,289 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-02-15 00:38:52,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:52,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254620298] [2022-02-15 00:38:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-15 00:38:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:52,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:52,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254620298] [2022-02-15 00:38:52,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254620298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:52,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:52,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:38:52,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973205971] [2022-02-15 00:38:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:52,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:38:52,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:38:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:52,457 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-02-15 00:38:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:53,616 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2022-02-15 00:38:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 00:38:53,617 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-02-15 00:38:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:53,618 INFO L225 Difference]: With dead ends: 586 [2022-02-15 00:38:53,618 INFO L226 Difference]: Without dead ends: 535 [2022-02-15 00:38:53,618 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-02-15 00:38:53,618 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 488 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:53,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 902 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:38:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-02-15 00:38:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-02-15 00:38:53,623 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-02-15 00:38:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-02-15 00:38:53,624 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-02-15 00:38:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:53,624 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-02-15 00:38:53,624 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-02-15 00:38:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-02-15 00:38:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-15 00:38:53,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:53,625 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-02-15 00:38:53,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 00:38:53,625 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-02-15 00:38:53,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:53,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978966127] [2022-02-15 00:38:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-15 00:38:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:53,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:53,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978966127] [2022-02-15 00:38:53,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978966127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:53,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:53,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:38:53,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789184331] [2022-02-15 00:38:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:53,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:38:53,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:38:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:38:53,772 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-02-15 00:38:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:54,663 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2022-02-15 00:38:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:38:54,663 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-02-15 00:38:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:54,664 INFO L225 Difference]: With dead ends: 523 [2022-02-15 00:38:54,665 INFO L226 Difference]: Without dead ends: 523 [2022-02-15 00:38:54,665 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-02-15 00:38:54,665 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 374 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:54,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1095 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-02-15 00:38:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-02-15 00:38:54,669 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-02-15 00:38:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-02-15 00:38:54,670 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-02-15 00:38:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:54,670 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-02-15 00:38:54,670 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-02-15 00:38:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-02-15 00:38:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-15 00:38:54,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:54,671 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-02-15 00:38:54,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 00:38:54,671 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-02-15 00:38:54,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:54,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075228027] [2022-02-15 00:38:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-15 00:38:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-15 00:38:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:54,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:54,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075228027] [2022-02-15 00:38:54,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075228027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:54,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:54,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:54,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952847072] [2022-02-15 00:38:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:54,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:54,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:54,854 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-02-15 00:38:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:55,476 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2022-02-15 00:38:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 00:38:55,476 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-02-15 00:38:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:55,478 INFO L225 Difference]: With dead ends: 585 [2022-02-15 00:38:55,478 INFO L226 Difference]: Without dead ends: 585 [2022-02-15 00:38:55,478 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-02-15 00:38:55,478 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 453 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:55,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1652 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-15 00:38:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-02-15 00:38:55,484 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-02-15 00:38:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-02-15 00:38:55,485 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-02-15 00:38:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:55,485 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-02-15 00:38:55,485 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-02-15 00:38:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-02-15 00:38:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 00:38:55,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:55,486 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-02-15 00:38:55,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-15 00:38:55,486 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-02-15 00:38:55,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:55,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299114893] [2022-02-15 00:38:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-15 00:38:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:55,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:55,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299114893] [2022-02-15 00:38:55,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299114893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:55,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:55,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 00:38:55,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071462719] [2022-02-15 00:38:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:55,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 00:38:55,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:55,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 00:38:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:55,705 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-02-15 00:38:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:56,434 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2022-02-15 00:38:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 00:38:56,435 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-02-15 00:38:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:56,436 INFO L225 Difference]: With dead ends: 523 [2022-02-15 00:38:56,436 INFO L226 Difference]: Without dead ends: 505 [2022-02-15 00:38:56,436 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-02-15 00:38:56,437 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 571 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:56,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 1560 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:38:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-15 00:38:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-02-15 00:38:56,441 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-02-15 00:38:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-02-15 00:38:56,442 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-02-15 00:38:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:56,442 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-02-15 00:38:56,442 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-02-15 00:38:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-02-15 00:38:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-15 00:38:56,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:56,443 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-02-15 00:38:56,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-15 00:38:56,443 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-02-15 00:38:56,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:56,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949999402] [2022-02-15 00:38:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-15 00:38:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:56,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:56,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949999402] [2022-02-15 00:38:56,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949999402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:56,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:56,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 00:38:56,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694412957] [2022-02-15 00:38:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:56,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 00:38:56,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 00:38:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:56,628 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-02-15 00:38:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:57,360 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2022-02-15 00:38:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 00:38:57,360 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-02-15 00:38:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:57,361 INFO L225 Difference]: With dead ends: 523 [2022-02-15 00:38:57,362 INFO L226 Difference]: Without dead ends: 505 [2022-02-15 00:38:57,362 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-02-15 00:38:57,362 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 251 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:57,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1742 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:38:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-15 00:38:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-02-15 00:38:57,366 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-02-15 00:38:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-02-15 00:38:57,366 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-02-15 00:38:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:57,367 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-02-15 00:38:57,367 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-02-15 00:38:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-02-15 00:38:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-15 00:38:57,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:57,368 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] [2022-02-15 00:38:57,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-15 00:38:57,368 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-02-15 00:38:57,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:57,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557155371] [2022-02-15 00:38:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:38:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:38:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-15 00:38:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:57,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-02-15 00:38:57,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:57,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557155371] [2022-02-15 00:38:57,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557155371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:57,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:57,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:38:57,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792396751] [2022-02-15 00:38:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:57,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:38:57,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:38:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:38:57,557 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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-02-15 00:38:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:58,172 INFO L93 Difference]: Finished difference Result 485 states and 577 transitions. [2022-02-15 00:38:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:38:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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 98 [2022-02-15 00:38:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:58,174 INFO L225 Difference]: With dead ends: 485 [2022-02-15 00:38:58,174 INFO L226 Difference]: Without dead ends: 483 [2022-02-15 00:38:58,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:58,174 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 390 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:58,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1161 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-15 00:38:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-02-15 00:38:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 361 states have (on average 1.2132963988919667) internal successors, (438), 367 states have internal predecessors, (438), 51 states have call successors, (51), 41 states have call predecessors, (51), 46 states have return successors, (57), 51 states have call predecessors, (57), 47 states have call successors, (57) [2022-02-15 00:38:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-02-15 00:38:58,178 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-02-15 00:38:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:58,178 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-02-15 00:38:58,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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-02-15 00:38:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-02-15 00:38:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-15 00:38:58,179 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:58,179 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-02-15 00:38:58,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-15 00:38:58,179 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-02-15 00:38:58,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:58,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625592675] [2022-02-15 00:38:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:38:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-15 00:38:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 00:38:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-15 00:38:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:58,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:58,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625592675] [2022-02-15 00:38:58,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625592675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:58,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:58,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:38:58,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524911030] [2022-02-15 00:38:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:58,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:38:58,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:38:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:38:58,349 INFO L87 Difference]: Start difference. First operand 459 states and 546 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 00:39:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:00,094 INFO L93 Difference]: Finished difference Result 1310 states and 1519 transitions. [2022-02-15 00:39:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 00:39:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-02-15 00:39:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:00,097 INFO L225 Difference]: With dead ends: 1310 [2022-02-15 00:39:00,097 INFO L226 Difference]: Without dead ends: 1310 [2022-02-15 00:39:00,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 00:39:00,098 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1541 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:00,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 839 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 00:39:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-02-15 00:39:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-02-15 00:39:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 820 states have (on average 1.197560975609756) internal successors, (982), 833 states have internal predecessors, (982), 103 states have call successors, (103), 93 states have call predecessors, (103), 112 states have return successors, (128), 111 states have call predecessors, (128), 99 states have call successors, (128) [2022-02-15 00:39:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-02-15 00:39:00,120 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-02-15 00:39:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:00,120 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-02-15 00:39:00,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 00:39:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-02-15 00:39:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-15 00:39:00,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:00,122 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-02-15 00:39:00,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-15 00:39:00,122 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-02-15 00:39:00,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:00,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438818306] [2022-02-15 00:39:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-15 00:39:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-15 00:39:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:00,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:00,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438818306] [2022-02-15 00:39:00,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438818306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:00,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:00,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:39:00,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598487812] [2022-02-15 00:39:00,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:00,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:39:00,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:39:00,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:39:00,397 INFO L87 Difference]: Start difference. First operand 1036 states and 1213 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-02-15 00:39:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:01,609 INFO L93 Difference]: Finished difference Result 1959 states and 2303 transitions. [2022-02-15 00:39:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 00:39:01,610 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-02-15 00:39:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:01,617 INFO L225 Difference]: With dead ends: 1959 [2022-02-15 00:39:01,617 INFO L226 Difference]: Without dead ends: 1897 [2022-02-15 00:39:01,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-02-15 00:39:01,632 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 516 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:01,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1950 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:39:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-02-15 00:39:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-02-15 00:39:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 792 states have (on average 1.196969696969697) internal successors, (948), 803 states have internal predecessors, (948), 97 states have call successors, (97), 91 states have call predecessors, (97), 110 states have return successors, (122), 105 states have call predecessors, (122), 93 states have call successors, (122) [2022-02-15 00:39:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-02-15 00:39:01,672 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-02-15 00:39:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:01,672 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-02-15 00:39:01,672 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-02-15 00:39:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-02-15 00:39:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-15 00:39:01,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:01,674 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-02-15 00:39:01,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-15 00:39:01,674 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 925491343, now seen corresponding path program 1 times [2022-02-15 00:39:01,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:01,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052456866] [2022-02-15 00:39:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-15 00:39:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 00:39:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:39:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:01,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:01,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052456866] [2022-02-15 00:39:01,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052456866] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:01,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:01,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 00:39:01,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458500406] [2022-02-15 00:39:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:01,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 00:39:01,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 00:39:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:39:01,897 INFO L87 Difference]: Start difference. First operand 1000 states and 1167 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-02-15 00:39:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:02,756 INFO L93 Difference]: Finished difference Result 1007 states and 1173 transitions. [2022-02-15 00:39:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 00:39:02,757 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-02-15 00:39:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:02,759 INFO L225 Difference]: With dead ends: 1007 [2022-02-15 00:39:02,759 INFO L226 Difference]: Without dead ends: 804 [2022-02-15 00:39:02,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-02-15 00:39:02,759 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 297 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:02,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 588 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:39:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-02-15 00:39:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-02-15 00:39:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 624 states have (on average 1.2003205128205128) internal successors, (749), 633 states have internal predecessors, (749), 81 states have call successors, (81), 76 states have call predecessors, (81), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-02-15 00:39:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-02-15 00:39:02,767 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-02-15 00:39:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:02,767 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-02-15 00:39:02,767 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-02-15 00:39:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-02-15 00:39:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-15 00:39:02,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:02,769 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-02-15 00:39:02,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-15 00:39:02,769 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-02-15 00:39:02,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:02,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158775010] [2022-02-15 00:39:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-15 00:39:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,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-02-15 00:39:03,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:03,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158775010] [2022-02-15 00:39:03,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158775010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:03,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:03,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 00:39:03,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428223028] [2022-02-15 00:39:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:03,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 00:39:03,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 00:39:03,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:39:03,026 INFO L87 Difference]: Start difference. First operand 796 states and 930 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-02-15 00:39:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:03,427 INFO L93 Difference]: Finished difference Result 872 states and 1024 transitions. [2022-02-15 00:39:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 00:39:03,431 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-02-15 00:39:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:03,433 INFO L225 Difference]: With dead ends: 872 [2022-02-15 00:39:03,433 INFO L226 Difference]: Without dead ends: 834 [2022-02-15 00:39:03,433 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-02-15 00:39:03,434 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:03,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 1188 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:39:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-02-15 00:39:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-02-15 00:39:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 640 states have (on average 1.1859375) internal successors, (759), 651 states have internal predecessors, (759), 83 states have call successors, (83), 76 states have call predecessors, (83), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-02-15 00:39:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-02-15 00:39:03,458 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-02-15 00:39:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:03,458 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-02-15 00:39:03,458 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-02-15 00:39:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-02-15 00:39:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-15 00:39:03,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:03,470 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-02-15 00:39:03,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-15 00:39:03,470 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-02-15 00:39:03,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:03,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749938515] [2022-02-15 00:39:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-15 00:39:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-15 00:39:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-15 00:39:03,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:03,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749938515] [2022-02-15 00:39:03,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749938515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:03,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:03,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 00:39:03,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329585378] [2022-02-15 00:39:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:03,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:39:03,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:03,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:39:03,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:39:03,655 INFO L87 Difference]: Start difference. First operand 814 states and 942 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-02-15 00:39:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:03,936 INFO L93 Difference]: Finished difference Result 717 states and 809 transitions. [2022-02-15 00:39:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 00:39:03,936 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-02-15 00:39:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:03,938 INFO L225 Difference]: With dead ends: 717 [2022-02-15 00:39:03,938 INFO L226 Difference]: Without dead ends: 717 [2022-02-15 00:39:03,938 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-02-15 00:39:03,938 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 219 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:03,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 805 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 00:39:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-02-15 00:39:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-02-15 00:39:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 354 states have (on average 1.1440677966101696) internal successors, (405), 358 states have internal predecessors, (405), 46 states have call successors, (46), 46 states have call predecessors, (46), 48 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-02-15 00:39:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-02-15 00:39:03,945 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-02-15 00:39:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:03,946 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-02-15 00:39:03,946 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-02-15 00:39:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-02-15 00:39:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-15 00:39:03,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:03,947 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-02-15 00:39:03,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-15 00:39:03,947 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-02-15 00:39:03,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:03,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706122735] [2022-02-15 00:39:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 00:39:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:39:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:04,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:04,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706122735] [2022-02-15 00:39:04,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706122735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:04,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:04,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:39:04,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048889092] [2022-02-15 00:39:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:04,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:39:04,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:39:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:39:04,160 INFO L87 Difference]: Start difference. First operand 449 states and 499 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-02-15 00:39:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:04,514 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2022-02-15 00:39:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:39:04,515 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-02-15 00:39:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:04,516 INFO L225 Difference]: With dead ends: 477 [2022-02-15 00:39:04,516 INFO L226 Difference]: Without dead ends: 477 [2022-02-15 00:39:04,516 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-02-15 00:39:04,516 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 256 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:04,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 688 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:39:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-02-15 00:39:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-02-15 00:39:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 364 states have internal predecessors, (411), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-02-15 00:39:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-02-15 00:39:04,520 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-02-15 00:39:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:04,520 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-02-15 00:39:04,520 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-02-15 00:39:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-02-15 00:39:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-15 00:39:04,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:04,521 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-02-15 00:39:04,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-15 00:39:04,521 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-02-15 00:39:04,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:04,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784575447] [2022-02-15 00:39:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 00:39:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:39:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:04,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:04,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784575447] [2022-02-15 00:39:04,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784575447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:04,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:04,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:39:04,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236722533] [2022-02-15 00:39:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:04,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:39:04,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:39:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:39:04,736 INFO L87 Difference]: Start difference. First operand 457 states and 507 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-02-15 00:39:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:05,254 INFO L93 Difference]: Finished difference Result 477 states and 527 transitions. [2022-02-15 00:39:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:39:05,255 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-02-15 00:39:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:05,256 INFO L225 Difference]: With dead ends: 477 [2022-02-15 00:39:05,256 INFO L226 Difference]: Without dead ends: 469 [2022-02-15 00:39:05,256 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-02-15 00:39:05,256 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 132 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:05,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 784 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:39:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-02-15 00:39:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-02-15 00:39:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.136111111111111) internal successors, (409), 364 states have internal predecessors, (409), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-02-15 00:39:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-02-15 00:39:05,260 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-02-15 00:39:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:05,260 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-02-15 00:39:05,260 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-02-15 00:39:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-02-15 00:39:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-02-15 00:39:05,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:05,261 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-02-15 00:39:05,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-02-15 00:39:05,261 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-02-15 00:39:05,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:05,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236775826] [2022-02-15 00:39:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-15 00:39:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-15 00:39:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-15 00:39:05,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:05,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236775826] [2022-02-15 00:39:05,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236775826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:05,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:05,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 00:39:05,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839670379] [2022-02-15 00:39:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:05,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 00:39:05,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 00:39:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-02-15 00:39:05,662 INFO L87 Difference]: Start difference. First operand 457 states and 505 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-02-15 00:39:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:06,268 INFO L93 Difference]: Finished difference Result 581 states and 661 transitions. [2022-02-15 00:39:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 00:39:06,268 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-02-15 00:39:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:06,269 INFO L225 Difference]: With dead ends: 581 [2022-02-15 00:39:06,269 INFO L226 Difference]: Without dead ends: 531 [2022-02-15 00:39:06,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 00:39:06,270 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 198 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:06,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 1461 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:39:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-02-15 00:39:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-02-15 00:39:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.146153846153846) internal successors, (447), 394 states have internal predecessors, (447), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-02-15 00:39:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-02-15 00:39:06,274 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-02-15 00:39:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:06,275 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-02-15 00:39:06,275 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-02-15 00:39:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-02-15 00:39:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-15 00:39:06,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:06,276 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-02-15 00:39:06,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-02-15 00:39:06,276 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-02-15 00:39:06,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:06,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588450721] [2022-02-15 00:39:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-15 00:39:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-15 00:39:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-15 00:39:06,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:06,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588450721] [2022-02-15 00:39:06,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588450721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:06,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:06,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 00:39:06,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424436871] [2022-02-15 00:39:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:06,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 00:39:06,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 00:39:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:39:06,529 INFO L87 Difference]: Start difference. First operand 491 states and 547 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-02-15 00:39:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:07,193 INFO L93 Difference]: Finished difference Result 529 states and 589 transitions. [2022-02-15 00:39:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 00:39:07,194 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-02-15 00:39:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:07,195 INFO L225 Difference]: With dead ends: 529 [2022-02-15 00:39:07,195 INFO L226 Difference]: Without dead ends: 519 [2022-02-15 00:39:07,195 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-02-15 00:39:07,195 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 116 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:07,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1250 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:39:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-15 00:39:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-02-15 00:39:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.141025641025641) internal successors, (445), 394 states have internal predecessors, (445), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-02-15 00:39:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-02-15 00:39:07,199 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-02-15 00:39:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:07,200 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-02-15 00:39:07,200 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-02-15 00:39:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-02-15 00:39:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-15 00:39:07,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:07,201 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-02-15 00:39:07,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-02-15 00:39:07,201 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-02-15 00:39:07,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:07,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453803574] [2022-02-15 00:39:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-02-15 00:39:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-02-15 00:39:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-15 00:39:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-15 00:39:07,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:07,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453803574] [2022-02-15 00:39:07,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453803574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:07,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:07,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 00:39:07,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017870321] [2022-02-15 00:39:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:07,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 00:39:07,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 00:39:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-02-15 00:39:07,507 INFO L87 Difference]: Start difference. First operand 491 states and 545 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-02-15 00:39:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:08,098 INFO L93 Difference]: Finished difference Result 553 states and 621 transitions. [2022-02-15 00:39:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 00:39:08,098 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-02-15 00:39:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:08,099 INFO L225 Difference]: With dead ends: 553 [2022-02-15 00:39:08,099 INFO L226 Difference]: Without dead ends: 491 [2022-02-15 00:39:08,100 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-02-15 00:39:08,100 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:08,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1113 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:39:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-15 00:39:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-02-15 00:39:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 382 states have (on average 1.1282722513089005) internal successors, (431), 386 states have internal predecessors, (431), 44 states have call successors, (44), 44 states have call predecessors, (44), 52 states have return successors, (52), 48 states have call predecessors, (52), 42 states have call successors, (52) [2022-02-15 00:39:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-02-15 00:39:08,105 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-02-15 00:39:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:08,105 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-02-15 00:39:08,106 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-02-15 00:39:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-02-15 00:39:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-02-15 00:39:08,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:08,106 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-02-15 00:39:08,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-02-15 00:39:08,107 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-02-15 00:39:08,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:08,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116400816] [2022-02-15 00:39:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-15 00:39:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-15 00:39:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-02-15 00:39:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-15 00:39:08,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:08,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116400816] [2022-02-15 00:39:08,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116400816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:08,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:08,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:39:08,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282656759] [2022-02-15 00:39:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:08,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:39:08,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:39:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:39:08,356 INFO L87 Difference]: Start difference. First operand 479 states and 527 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-02-15 00:39:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:08,834 INFO L93 Difference]: Finished difference Result 473 states and 515 transitions. [2022-02-15 00:39:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:39:08,835 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-02-15 00:39:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:08,836 INFO L225 Difference]: With dead ends: 473 [2022-02-15 00:39:08,836 INFO L226 Difference]: Without dead ends: 451 [2022-02-15 00:39:08,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-02-15 00:39:08,836 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 346 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:08,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 580 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:39:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-15 00:39:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-02-15 00:39:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.1107784431137724) internal successors, (371), 338 states have internal predecessors, (371), 42 states have call successors, (42), 42 states have call predecessors, (42), 46 states have return successors, (46), 42 states have call predecessors, (46), 40 states have call successors, (46) [2022-02-15 00:39:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-02-15 00:39:08,840 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-02-15 00:39:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:08,840 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-02-15 00:39:08,840 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-02-15 00:39:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-02-15 00:39:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-15 00:39:08,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:08,841 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-02-15 00:39:08,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-02-15 00:39:08,842 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-02-15 00:39:08,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:08,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937487556] [2022-02-15 00:39:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:08,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 00:39:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-15 00:39:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-02-15 00:39:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-15 00:39:09,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:09,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937487556] [2022-02-15 00:39:09,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937487556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:09,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:09,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 00:39:09,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461240016] [2022-02-15 00:39:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:09,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 00:39:09,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 00:39:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-02-15 00:39:09,095 INFO L87 Difference]: Start difference. First operand 423 states and 459 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-02-15 00:39:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:09,409 INFO L93 Difference]: Finished difference Result 401 states and 431 transitions. [2022-02-15 00:39:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:39:09,410 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-02-15 00:39:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:09,410 INFO L225 Difference]: With dead ends: 401 [2022-02-15 00:39:09,410 INFO L226 Difference]: Without dead ends: 381 [2022-02-15 00:39:09,411 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-02-15 00:39:09,411 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 217 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:09,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 732 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:39:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-02-15 00:39:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-02-15 00:39:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 300 states have internal predecessors, (327), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-02-15 00:39:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-02-15 00:39:09,414 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-02-15 00:39:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:09,414 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-02-15 00:39:09,414 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-02-15 00:39:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-02-15 00:39:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-15 00:39:09,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:09,415 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-02-15 00:39:09,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-02-15 00:39:09,415 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-02-15 00:39:09,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:09,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797647799] [2022-02-15 00:39:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 00:39:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-15 00:39:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-15 00:39:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-15 00:39:09,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:09,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797647799] [2022-02-15 00:39:09,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797647799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:09,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:09,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 00:39:09,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435374858] [2022-02-15 00:39:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:09,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 00:39:09,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 00:39:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-02-15 00:39:09,720 INFO L87 Difference]: Start difference. First operand 381 states and 409 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-02-15 00:39:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:10,600 INFO L93 Difference]: Finished difference Result 661 states and 706 transitions. [2022-02-15 00:39:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-15 00:39:10,600 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-02-15 00:39:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:10,601 INFO L225 Difference]: With dead ends: 661 [2022-02-15 00:39:10,601 INFO L226 Difference]: Without dead ends: 387 [2022-02-15 00:39:10,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 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-02-15 00:39:10,602 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 555 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:10,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 618 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:39:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-02-15 00:39:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-02-15 00:39:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0939597315436242) internal successors, (326), 300 states have internal predecessors, (326), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-02-15 00:39:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-02-15 00:39:10,605 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-02-15 00:39:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:10,605 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-02-15 00:39:10,605 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-02-15 00:39:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-02-15 00:39:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-15 00:39:10,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:10,606 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-02-15 00:39:10,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-02-15 00:39:10,607 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-02-15 00:39:10,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:10,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587293612] [2022-02-15 00:39:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:39:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:39:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:39:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-15 00:39:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:39:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:39:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:39:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:39:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:39:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 00:39:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 00:39:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-15 00:39:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-15 00:39:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-15 00:39:10,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:10,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587293612] [2022-02-15 00:39:10,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587293612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:10,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:10,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 00:39:10,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005830870] [2022-02-15 00:39:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:10,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 00:39:10,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 00:39:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-02-15 00:39:10,993 INFO L87 Difference]: Start difference. First operand 381 states and 408 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-02-15 00:39:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:11,917 INFO L93 Difference]: Finished difference Result 384 states and 413 transitions. [2022-02-15 00:39:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-15 00:39:11,917 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-02-15 00:39:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:11,918 INFO L225 Difference]: With dead ends: 384 [2022-02-15 00:39:11,918 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 00:39:11,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 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-02-15 00:39:11,918 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 384 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:11,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 720 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:39:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 00:39:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 00:39:11,919 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-02-15 00:39:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 00:39:11,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-02-15 00:39:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:11,919 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 00:39:11,919 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-02-15 00:39:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 00:39:11,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 00:39:11,921 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:39:11,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-02-15 00:39:11,923 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-15 00:39:11,924 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:39:11,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:39:11 BasicIcfg [2022-02-15 00:39:11,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:39:11,928 INFO L158 Benchmark]: Toolchain (without parser) took 71849.65ms. Allocated memory was 195.0MB in the beginning and 414.2MB in the end (delta: 219.2MB). Free memory was 146.0MB in the beginning and 332.4MB in the end (delta: -186.4MB). Peak memory consumption was 33.4MB. Max. memory is 8.0GB. [2022-02-15 00:39:11,928 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:39:11,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.66ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 160.7MB in the end (delta: -14.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-02-15 00:39:11,928 INFO L158 Benchmark]: Boogie Preprocessor took 92.47ms. Allocated memory is still 195.0MB. Free memory was 160.7MB in the beginning and 156.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-15 00:39:11,928 INFO L158 Benchmark]: RCFGBuilder took 852.71ms. Allocated memory is still 195.0MB. Free memory was 156.4MB in the beginning and 103.6MB in the end (delta: 52.8MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-02-15 00:39:11,929 INFO L158 Benchmark]: IcfgTransformer took 32.03ms. Allocated memory is still 195.0MB. Free memory was 103.6MB in the beginning and 97.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-02-15 00:39:11,929 INFO L158 Benchmark]: TraceAbstraction took 70477.05ms. Allocated memory was 195.0MB in the beginning and 414.2MB in the end (delta: 219.2MB). Free memory was 96.6MB in the beginning and 332.4MB in the end (delta: -235.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:39:11,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.66ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 160.7MB in the end (delta: -14.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.47ms. Allocated memory is still 195.0MB. Free memory was 160.7MB in the beginning and 156.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 852.71ms. Allocated memory is still 195.0MB. Free memory was 156.4MB in the beginning and 103.6MB in the end (delta: 52.8MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * IcfgTransformer took 32.03ms. Allocated memory is still 195.0MB. Free memory was 103.6MB in the beginning and 97.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 70477.05ms. Allocated memory was 195.0MB in the beginning and 414.2MB in the end (delta: 219.2MB). Free memory was 96.6MB in the beginning and 332.4MB in the end (delta: -235.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 389 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.4s, OverallIterations: 65, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 57.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37391 SdHoareTripleChecker+Valid, 48.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36907 mSDsluCounter, 72268 SdHoareTripleChecker+Invalid, 41.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47602 mSDsCounter, 11352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95262 IncrementalHoareTripleChecker+Invalid, 106614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11352 mSolverCounterUnsat, 24666 mSDtfsCounter, 95262 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1854 GetRequests, 818 SyntacticMatches, 7 SemanticMatches, 1029 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1036occurred in iteration=52, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 3956 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 4642 NumberOfCodeBlocks, 4642 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4577 ConstructedInterpolants, 0 QuantifiedInterpolants, 19819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-15 00:39:11,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...