/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-7390193 [2022-04-05 04:11:25,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 04:11:25,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 04:11:25,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 04:11:25,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 04:11:25,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 04:11:25,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 04:11:25,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 04:11:25,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 04:11:25,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 04:11:25,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 04:11:25,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 04:11:25,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 04:11:25,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 04:11:25,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 04:11:25,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 04:11:25,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 04:11:25,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 04:11:25,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 04:11:25,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 04:11:25,772 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 04:11:25,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 04:11:25,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 04:11:25,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 04:11:25,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 04:11:25,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 04:11:25,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 04:11:25,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 04:11:25,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 04:11:25,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 04:11:25,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 04:11:25,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 04:11:25,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 04:11:25,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 04:11:25,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 04:11:25,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 04:11:25,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 04:11:25,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 04:11:25,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 04:11:25,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 04:11:25,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 04:11:25,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 04:11:25,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 04:11:25,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 04:11:25,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 04:11:25,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 04:11:25,805 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 04:11:25,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 04:11:25,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 04:11:25,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 04:11:25,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 04:11:25,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 04:11:25,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:11:25,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 04:11:25,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 04:11:25,808 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 04:11:25,808 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-04-05 04:11:25,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 04:11:26,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 04:11:26,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 04:11:26,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 04:11:26,018 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 04:11:26,019 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-04-05 04:11:26,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ec15adf/0237d827ba6b43b7a32a36f5e584e08b/FLAGe7a0f3f5b [2022-04-05 04:11:26,458 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 04:11:26,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-04-05 04:11:26,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ec15adf/0237d827ba6b43b7a32a36f5e584e08b/FLAGe7a0f3f5b [2022-04-05 04:11:26,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ec15adf/0237d827ba6b43b7a32a36f5e584e08b [2022-04-05 04:11:26,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 04:11:26,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 04:11:26,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 04:11:26,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 04:11:26,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 04:11:26,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5dae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26, skipping insertion in model container [2022-04-05 04:11:26,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 04:11:26,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 04:11:26,834 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-04-05 04:11:26,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:11:26,854 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 04:11:26,914 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-04-05 04:11:26,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:11:26,930 INFO L208 MainTranslator]: Completed translation [2022-04-05 04:11:26,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26 WrapperNode [2022-04-05 04:11:26,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 04:11:26,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 04:11:26,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 04:11:26,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 04:11:26,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:26,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:27,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 04:11:27,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 04:11:27,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 04:11:27,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 04:11:27,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (1/1) ... [2022-04-05 04:11:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:11:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 04:11:27,072 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-04-05 04:11:27,102 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-04-05 04:11:27,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 04:11:27,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-04-05 04:11:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-04-05 04:11:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-04-05 04:11:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-05 04:11:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 04:11:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-05 04:11:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-05 04:11:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-04-05 04:11:27,114 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-04-05 04:11:27,114 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-04-05 04:11:27,114 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-04-05 04:11:27,114 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-04-05 04:11:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-04-05 04:11:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 04:11:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 04:11:27,370 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 04:11:27,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 04:11:27,401 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,427 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:27,427 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:27,433 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,439 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:27,439 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:27,443 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,629 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-05 04:11:27,630 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-05 04:11:27,631 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,681 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-04-05 04:11:27,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-04-05 04:11:27,700 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,714 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-05 04:11:27,714 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-05 04:11:27,805 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,814 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:27,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:27,815 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,821 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:27,821 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:27,821 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:27,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:27,880 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:27,930 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-04-05 04:11:27,930 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-04-05 04:11:27,932 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:28,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-04-05 04:11:28,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-04-05 04:11:28,077 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:28,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:28,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:28,081 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:28,092 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:28,093 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:28,093 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:11:28,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:11:28,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:11:28,107 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 04:11:28,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 04:11:28,115 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 04:11:28,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:28 BoogieIcfgContainer [2022-04-05 04:11:28,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 04:11:28,119 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 04:11:28,119 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 04:11:28,120 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 04:11:28,123 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:28" (1/1) ... [2022-04-05 04:11:28,125 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 04:11:28,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:11:28 BasicIcfg [2022-04-05 04:11:28,155 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 04:11:28,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 04:11:28,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 04:11:28,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 04:11:28,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:11:26" (1/4) ... [2022-04-05 04:11:28,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:11:28, skipping insertion in model container [2022-04-05 04:11:28,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:11:26" (2/4) ... [2022-04-05 04:11:28,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:11:28, skipping insertion in model container [2022-04-05 04:11:28,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:11:28" (3/4) ... [2022-04-05 04:11:28,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:11:28, skipping insertion in model container [2022-04-05 04:11:28,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:11:28" (4/4) ... [2022-04-05 04:11:28,171 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cJordan [2022-04-05 04:11:28,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 04:11:28,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 04:11:28,214 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 04:11:28,218 INFO L340 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 [2022-04-05 04:11:28,219 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 04:11:28,232 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-04-05 04:11:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 04:11:28,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:28,238 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:28,238 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-04-05 04:11:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381388688] [2022-04-05 04:11:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:28,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381388688] [2022-04-05 04:11:28,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381388688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:28,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:28,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 04:11:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906661034] [2022-04-05 04:11:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:28,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 04:11:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 04:11:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 04:11:28,570 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-04-05 04:11:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:29,600 INFO L93 Difference]: Finished difference Result 430 states and 602 transitions. [2022-04-05 04:11:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 04:11:29,602 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-04-05 04:11:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:29,610 INFO L225 Difference]: With dead ends: 430 [2022-04-05 04:11:29,611 INFO L226 Difference]: Without dead ends: 422 [2022-04-05 04:11:29,612 INFO L912 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-04-05 04:11:29,614 INFO L913 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:29,614 INFO L914 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-04-05 04:11:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-05 04:11:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-04-05 04:11:29,658 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-04-05 04:11:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-04-05 04:11:29,661 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-04-05 04:11:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:29,661 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-04-05 04:11:29,661 INFO L479 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-04-05 04:11:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-04-05 04:11:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-05 04:11:29,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:29,662 INFO L499 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-04-05 04:11:29,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 04:11:29,663 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-04-05 04:11:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580648610] [2022-04-05 04:11:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:29,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580648610] [2022-04-05 04:11:29,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580648610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:29,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:29,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454287751] [2022-04-05 04:11:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:29,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:29,833 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-04-05 04:11:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:30,617 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2022-04-05 04:11:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:11:30,617 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-04-05 04:11:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:30,620 INFO L225 Difference]: With dead ends: 585 [2022-04-05 04:11:30,620 INFO L226 Difference]: Without dead ends: 584 [2022-04-05 04:11:30,621 INFO L912 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-04-05 04:11:30,622 INFO L913 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-04-05 04:11:30,622 INFO L914 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-04-05 04:11:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-05 04:11:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-04-05 04:11:30,639 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-04-05 04:11:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-04-05 04:11:30,641 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-04-05 04:11:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:30,641 INFO L478 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-04-05 04:11:30,641 INFO L479 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-04-05 04:11:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-04-05 04:11:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-05 04:11:30,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:30,642 INFO L499 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-04-05 04:11:30,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 04:11:30,643 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-04-05 04:11:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:30,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135713977] [2022-04-05 04:11:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135713977] [2022-04-05 04:11:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135713977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:30,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:30,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059974922] [2022-04-05 04:11:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:30,773 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:30,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:30,773 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-04-05 04:11:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:31,345 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2022-04-05 04:11:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:11:31,346 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-04-05 04:11:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:31,350 INFO L225 Difference]: With dead ends: 676 [2022-04-05 04:11:31,350 INFO L226 Difference]: Without dead ends: 676 [2022-04-05 04:11:31,351 INFO L912 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-04-05 04:11:31,355 INFO L913 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-04-05 04:11:31,356 INFO L914 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-04-05 04:11:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-04-05 04:11:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-04-05 04:11:31,381 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-04-05 04:11:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-04-05 04:11:31,385 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-04-05 04:11:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:31,385 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-04-05 04:11:31,386 INFO L479 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-04-05 04:11:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-04-05 04:11:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-05 04:11:31,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:31,391 INFO L499 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-04-05 04:11:31,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 04:11:31,391 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-04-05 04:11:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:31,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939246163] [2022-04-05 04:11:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939246163] [2022-04-05 04:11:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939246163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:31,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:31,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248068408] [2022-04-05 04:11:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:31,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:31,568 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-04-05 04:11:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:32,452 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2022-04-05 04:11:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:11:32,452 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-04-05 04:11:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:32,457 INFO L225 Difference]: With dead ends: 819 [2022-04-05 04:11:32,457 INFO L226 Difference]: Without dead ends: 819 [2022-04-05 04:11:32,458 INFO L912 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-04-05 04:11:32,464 INFO L913 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-04-05 04:11:32,465 INFO L914 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-04-05 04:11:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-04-05 04:11:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-04-05 04:11:32,484 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-04-05 04:11:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-04-05 04:11:32,487 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-04-05 04:11:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:32,487 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-04-05 04:11:32,487 INFO L479 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-04-05 04:11:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-04-05 04:11:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 04:11:32,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:32,488 INFO L499 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-04-05 04:11:32,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 04:11:32,489 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-04-05 04:11:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:32,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635840721] [2022-04-05 04:11:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:11:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:32,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635840721] [2022-04-05 04:11:32,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635840721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:32,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:32,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:32,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483841079] [2022-04-05 04:11:32,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:32,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:32,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:32,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:32,636 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-04-05 04:11:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:33,361 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2022-04-05 04:11:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:33,362 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-04-05 04:11:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:33,365 INFO L225 Difference]: With dead ends: 860 [2022-04-05 04:11:33,365 INFO L226 Difference]: Without dead ends: 860 [2022-04-05 04:11:33,365 INFO L912 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-04-05 04:11:33,365 INFO L913 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-04-05 04:11:33,366 INFO L914 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-04-05 04:11:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-04-05 04:11:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-04-05 04:11:33,380 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-04-05 04:11:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-04-05 04:11:33,383 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-04-05 04:11:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:33,383 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-04-05 04:11:33,383 INFO L479 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-04-05 04:11:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-04-05 04:11:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 04:11:33,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:33,384 INFO L499 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-04-05 04:11:33,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 04:11:33,384 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-04-05 04:11:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:33,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370020458] [2022-04-05 04:11:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:33,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370020458] [2022-04-05 04:11:33,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370020458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:33,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:33,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:11:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244448325] [2022-04-05 04:11:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:33,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:11:33,488 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-04-05 04:11:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:34,134 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2022-04-05 04:11:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:11:34,134 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-04-05 04:11:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:34,139 INFO L225 Difference]: With dead ends: 839 [2022-04-05 04:11:34,139 INFO L226 Difference]: Without dead ends: 839 [2022-04-05 04:11:34,139 INFO L912 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-04-05 04:11:34,141 INFO L913 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-04-05 04:11:34,141 INFO L914 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-04-05 04:11:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-04-05 04:11:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-04-05 04:11:34,163 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-04-05 04:11:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-04-05 04:11:34,167 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-04-05 04:11:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:34,168 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-04-05 04:11:34,168 INFO L479 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-04-05 04:11:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-04-05 04:11:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-05 04:11:34,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:34,169 INFO L499 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-04-05 04:11:34,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 04:11:34,169 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-04-05 04:11:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:34,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090887481] [2022-04-05 04:11:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:34,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090887481] [2022-04-05 04:11:34,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090887481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:34,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:34,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:34,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594150230] [2022-04-05 04:11:34,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:34,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:34,475 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-04-05 04:11:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:35,813 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2022-04-05 04:11:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:35,814 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-04-05 04:11:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:35,817 INFO L225 Difference]: With dead ends: 871 [2022-04-05 04:11:35,817 INFO L226 Difference]: Without dead ends: 871 [2022-04-05 04:11:35,817 INFO L912 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-04-05 04:11:35,818 INFO L913 BasicCegarLoop]: 455 mSDtfsCounter, 1244 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:35,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1048 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:11:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-04-05 04:11:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-04-05 04:11:35,830 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-04-05 04:11:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-04-05 04:11:35,833 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-04-05 04:11:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:35,833 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-04-05 04:11:35,833 INFO L479 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-04-05 04:11:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-04-05 04:11:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-05 04:11:35,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:35,834 INFO L499 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-04-05 04:11:35,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 04:11:35,834 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-04-05 04:11:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066983656] [2022-04-05 04:11:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066983656] [2022-04-05 04:11:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066983656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089724773] [2022-04-05 04:11:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:36,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:36,012 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-04-05 04:11:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:37,497 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2022-04-05 04:11:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:37,498 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-04-05 04:11:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:37,501 INFO L225 Difference]: With dead ends: 871 [2022-04-05 04:11:37,501 INFO L226 Difference]: Without dead ends: 871 [2022-04-05 04:11:37,502 INFO L912 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-04-05 04:11:37,502 INFO L913 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-04-05 04:11:37,502 INFO L914 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-04-05 04:11:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-04-05 04:11:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-04-05 04:11:37,514 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-04-05 04:11:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-04-05 04:11:37,516 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-04-05 04:11:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:37,517 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-04-05 04:11:37,517 INFO L479 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-04-05 04:11:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-04-05 04:11:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-05 04:11:37,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:37,518 INFO L499 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-04-05 04:11:37,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 04:11:37,518 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-04-05 04:11:37,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:37,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308450244] [2022-04-05 04:11:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:37,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:11:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:37,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308450244] [2022-04-05 04:11:37,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308450244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:37,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:37,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521737269] [2022-04-05 04:11:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:37,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:37,653 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-04-05 04:11:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:38,758 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2022-04-05 04:11:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:38,758 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-04-05 04:11:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:38,761 INFO L225 Difference]: With dead ends: 879 [2022-04-05 04:11:38,761 INFO L226 Difference]: Without dead ends: 867 [2022-04-05 04:11:38,762 INFO L912 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-04-05 04:11:38,762 INFO L913 BasicCegarLoop]: 479 mSDtfsCounter, 475 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:38,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1369 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:11:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-04-05 04:11:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-04-05 04:11:38,776 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-04-05 04:11:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-04-05 04:11:38,778 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2022-04-05 04:11:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:38,779 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-04-05 04:11:38,779 INFO L479 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-04-05 04:11:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-04-05 04:11:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-05 04:11:38,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:38,779 INFO L499 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-04-05 04:11:38,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 04:11:38,780 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-04-05 04:11:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661453189] [2022-04-05 04:11:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661453189] [2022-04-05 04:11:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661453189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:38,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:38,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524938954] [2022-04-05 04:11:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:38,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:38,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:38,935 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-04-05 04:11:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:40,131 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2022-04-05 04:11:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:40,132 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-04-05 04:11:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:40,135 INFO L225 Difference]: With dead ends: 877 [2022-04-05 04:11:40,135 INFO L226 Difference]: Without dead ends: 860 [2022-04-05 04:11:40,135 INFO L912 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-04-05 04:11:40,135 INFO L913 BasicCegarLoop]: 475 mSDtfsCounter, 319 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:40,135 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1412 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 04:11:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-04-05 04:11:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-04-05 04:11:40,147 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-04-05 04:11:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-04-05 04:11:40,149 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2022-04-05 04:11:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:40,149 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-04-05 04:11:40,149 INFO L479 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-04-05 04:11:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-04-05 04:11:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-05 04:11:40,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:40,150 INFO L499 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-04-05 04:11:40,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 04:11:40,150 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-04-05 04:11:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:40,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660763754] [2022-04-05 04:11:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660763754] [2022-04-05 04:11:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660763754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:40,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:40,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669958575] [2022-04-05 04:11:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:40,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:40,266 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-04-05 04:11:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:41,236 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2022-04-05 04:11:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:41,236 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-04-05 04:11:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:41,239 INFO L225 Difference]: With dead ends: 835 [2022-04-05 04:11:41,240 INFO L226 Difference]: Without dead ends: 835 [2022-04-05 04:11:41,240 INFO L912 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-04-05 04:11:41,240 INFO L913 BasicCegarLoop]: 456 mSDtfsCounter, 547 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:41,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1012 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-04-05 04:11:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-04-05 04:11:41,252 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-04-05 04:11:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-04-05 04:11:41,254 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-04-05 04:11:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:41,254 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-04-05 04:11:41,254 INFO L479 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-04-05 04:11:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-04-05 04:11:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-05 04:11:41,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:41,256 INFO L499 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-04-05 04:11:41,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 04:11:41,256 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-04-05 04:11:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727829124] [2022-04-05 04:11:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:41,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727829124] [2022-04-05 04:11:41,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727829124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:41,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:41,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319082621] [2022-04-05 04:11:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:41,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:41,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:41,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:41,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:41,394 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-04-05 04:11:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:42,374 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2022-04-05 04:11:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:42,374 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-04-05 04:11:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:42,377 INFO L225 Difference]: With dead ends: 840 [2022-04-05 04:11:42,377 INFO L226 Difference]: Without dead ends: 840 [2022-04-05 04:11:42,377 INFO L912 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-04-05 04:11:42,377 INFO L913 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-04-05 04:11:42,377 INFO L914 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-04-05 04:11:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-04-05 04:11:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-04-05 04:11:42,388 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-04-05 04:11:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-04-05 04:11:42,390 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-04-05 04:11:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:42,390 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-04-05 04:11:42,390 INFO L479 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-04-05 04:11:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-04-05 04:11:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-05 04:11:42,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:42,391 INFO L499 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-04-05 04:11:42,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 04:11:42,391 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-04-05 04:11:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:42,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208415653] [2022-04-05 04:11:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:42,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208415653] [2022-04-05 04:11:42,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208415653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:42,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:42,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484779337] [2022-04-05 04:11:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:42,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:42,500 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-04-05 04:11:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:43,454 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2022-04-05 04:11:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:43,455 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-04-05 04:11:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:43,464 INFO L225 Difference]: With dead ends: 838 [2022-04-05 04:11:43,464 INFO L226 Difference]: Without dead ends: 838 [2022-04-05 04:11:43,465 INFO L912 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-04-05 04:11:43,465 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:43,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 1029 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-05 04:11:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-04-05 04:11:43,475 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-04-05 04:11:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-04-05 04:11:43,477 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-04-05 04:11:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:43,477 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-04-05 04:11:43,477 INFO L479 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-04-05 04:11:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-04-05 04:11:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 04:11:43,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:43,478 INFO L499 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-04-05 04:11:43,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 04:11:43,478 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-04-05 04:11:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:43,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818955140] [2022-04-05 04:11:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:43,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818955140] [2022-04-05 04:11:43,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818955140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:43,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:43,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306199047] [2022-04-05 04:11:43,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:43,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:43,619 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-04-05 04:11:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:44,391 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2022-04-05 04:11:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:44,391 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-04-05 04:11:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:44,394 INFO L225 Difference]: With dead ends: 858 [2022-04-05 04:11:44,394 INFO L226 Difference]: Without dead ends: 843 [2022-04-05 04:11:44,394 INFO L912 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-04-05 04:11:44,395 INFO L913 BasicCegarLoop]: 457 mSDtfsCounter, 689 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:44,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 1264 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:11:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-04-05 04:11:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-04-05 04:11:44,406 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-04-05 04:11:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-04-05 04:11:44,408 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-04-05 04:11:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:44,409 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-04-05 04:11:44,409 INFO L479 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-04-05 04:11:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-04-05 04:11:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-05 04:11:44,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:44,409 INFO L499 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-04-05 04:11:44,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 04:11:44,410 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-04-05 04:11:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31833943] [2022-04-05 04:11:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:44,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31833943] [2022-04-05 04:11:44,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31833943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:44,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:44,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420147515] [2022-04-05 04:11:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:44,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:44,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:44,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:44,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:44,540 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-04-05 04:11:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:45,400 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2022-04-05 04:11:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:11:45,401 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-04-05 04:11:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:45,404 INFO L225 Difference]: With dead ends: 855 [2022-04-05 04:11:45,404 INFO L226 Difference]: Without dead ends: 804 [2022-04-05 04:11:45,404 INFO L912 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-04-05 04:11:45,405 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:45,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 827 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-04-05 04:11:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-04-05 04:11:45,416 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-04-05 04:11:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-05 04:11:45,418 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-04-05 04:11:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:45,418 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-05 04:11:45,418 INFO L479 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-04-05 04:11:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-05 04:11:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-05 04:11:45,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:45,420 INFO L499 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-04-05 04:11:45,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 04:11:45,420 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-04-05 04:11:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262246573] [2022-04-05 04:11:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:45,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262246573] [2022-04-05 04:11:45,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262246573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:45,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:45,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 04:11:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272122935] [2022-04-05 04:11:45,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:45,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 04:11:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 04:11:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 04:11:45,554 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-04-05 04:11:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:46,587 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2022-04-05 04:11:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:46,587 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-04-05 04:11:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:46,590 INFO L225 Difference]: With dead ends: 1131 [2022-04-05 04:11:46,590 INFO L226 Difference]: Without dead ends: 1131 [2022-04-05 04:11:46,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:46,591 INFO L913 BasicCegarLoop]: 533 mSDtfsCounter, 490 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:46,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 766 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-04-05 04:11:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-04-05 04:11:46,603 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-04-05 04:11:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-04-05 04:11:46,605 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-04-05 04:11:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:46,605 INFO L478 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-04-05 04:11:46,605 INFO L479 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-04-05 04:11:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-04-05 04:11:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-05 04:11:46,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:46,606 INFO L499 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-04-05 04:11:46,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 04:11:46,606 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-04-05 04:11:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:46,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513416082] [2022-04-05 04:11:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:46,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513416082] [2022-04-05 04:11:46,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513416082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:46,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:46,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791383540] [2022-04-05 04:11:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:46,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:46,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:46,727 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-04-05 04:11:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:47,607 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2022-04-05 04:11:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:11:47,608 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-04-05 04:11:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:47,610 INFO L225 Difference]: With dead ends: 930 [2022-04-05 04:11:47,610 INFO L226 Difference]: Without dead ends: 915 [2022-04-05 04:11:47,610 INFO L912 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-04-05 04:11:47,610 INFO L913 BasicCegarLoop]: 448 mSDtfsCounter, 556 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:47,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1275 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-04-05 04:11:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-04-05 04:11:47,620 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-04-05 04:11:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-04-05 04:11:47,622 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-04-05 04:11:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:47,622 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-04-05 04:11:47,622 INFO L479 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-04-05 04:11:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-04-05 04:11:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 04:11:47,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:47,623 INFO L499 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-04-05 04:11:47,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 04:11:47,623 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-04-05 04:11:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:47,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592921578] [2022-04-05 04:11:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:47,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592921578] [2022-04-05 04:11:47,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592921578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:47,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:47,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761663210] [2022-04-05 04:11:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:47,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:47,804 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-04-05 04:11:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:49,010 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2022-04-05 04:11:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:49,010 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-04-05 04:11:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:49,013 INFO L225 Difference]: With dead ends: 936 [2022-04-05 04:11:49,013 INFO L226 Difference]: Without dead ends: 936 [2022-04-05 04:11:49,013 INFO L912 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-04-05 04:11:49,022 INFO L913 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.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:49,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1479 Valid, 837 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-04-05 04:11:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-04-05 04:11:49,032 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-04-05 04:11:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-04-05 04:11:49,034 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-04-05 04:11:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:49,034 INFO L478 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-04-05 04:11:49,034 INFO L479 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-04-05 04:11:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-04-05 04:11:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 04:11:49,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:49,035 INFO L499 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-04-05 04:11:49,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 04:11:49,035 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-04-05 04:11:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:49,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164355173] [2022-04-05 04:11:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164355173] [2022-04-05 04:11:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164355173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:49,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:49,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706691321] [2022-04-05 04:11:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:49,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:49,181 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-04-05 04:11:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:50,707 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2022-04-05 04:11:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-05 04:11:50,708 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-04-05 04:11:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:50,711 INFO L225 Difference]: With dead ends: 1075 [2022-04-05 04:11:50,711 INFO L226 Difference]: Without dead ends: 1075 [2022-04-05 04:11:50,711 INFO L912 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-04-05 04:11:50,712 INFO L913 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-04-05 04:11:50,712 INFO L914 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-04-05 04:11:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-04-05 04:11:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-04-05 04:11:50,724 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-04-05 04:11:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-04-05 04:11:50,725 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-04-05 04:11:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:50,725 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-04-05 04:11:50,726 INFO L479 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-04-05 04:11:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-04-05 04:11:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 04:11:50,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:50,728 INFO L499 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-04-05 04:11:50,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 04:11:50,728 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-04-05 04:11:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:50,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112398401] [2022-04-05 04:11:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 04:11:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112398401] [2022-04-05 04:11:50,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112398401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:50,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:50,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425904309] [2022-04-05 04:11:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:50,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:50,866 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-04-05 04:11:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:51,804 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2022-04-05 04:11:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:51,805 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-04-05 04:11:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:51,808 INFO L225 Difference]: With dead ends: 976 [2022-04-05 04:11:51,808 INFO L226 Difference]: Without dead ends: 959 [2022-04-05 04:11:51,808 INFO L912 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-04-05 04:11:51,808 INFO L913 BasicCegarLoop]: 452 mSDtfsCounter, 478 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:51,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1461 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-04-05 04:11:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-04-05 04:11:51,823 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-04-05 04:11:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-04-05 04:11:51,825 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-04-05 04:11:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:51,825 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-04-05 04:11:51,825 INFO L479 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-04-05 04:11:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-04-05 04:11:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:51,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:51,827 INFO L499 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-04-05 04:11:51,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-05 04:11:51,827 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-04-05 04:11:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914452741] [2022-04-05 04:11:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-05 04:11:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:51,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:51,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914452741] [2022-04-05 04:11:51,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914452741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:51,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:51,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787394892] [2022-04-05 04:11:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:51,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:51,952 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-04-05 04:11:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:52,829 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2022-04-05 04:11:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:52,830 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-04-05 04:11:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:52,832 INFO L225 Difference]: With dead ends: 685 [2022-04-05 04:11:52,832 INFO L226 Difference]: Without dead ends: 685 [2022-04-05 04:11:52,832 INFO L912 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-04-05 04:11:52,832 INFO L913 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-04-05 04:11:52,832 INFO L914 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-04-05 04:11:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-04-05 04:11:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-04-05 04:11:52,839 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-04-05 04:11:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-04-05 04:11:52,840 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-04-05 04:11:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:52,840 INFO L478 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-04-05 04:11:52,840 INFO L479 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-04-05 04:11:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-04-05 04:11:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:52,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:52,841 INFO L499 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-04-05 04:11:52,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-05 04:11:52,841 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-04-05 04:11:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957642218] [2022-04-05 04:11:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:52,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:53,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957642218] [2022-04-05 04:11:53,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957642218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:53,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:53,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447290551] [2022-04-05 04:11:53,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:53,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:53,008 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-04-05 04:11:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:53,971 INFO L93 Difference]: Finished difference Result 670 states and 845 transitions. [2022-04-05 04:11:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:53,973 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-04-05 04:11:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:53,974 INFO L225 Difference]: With dead ends: 670 [2022-04-05 04:11:53,975 INFO L226 Difference]: Without dead ends: 645 [2022-04-05 04:11:53,975 INFO L912 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-04-05 04:11:53,975 INFO L913 BasicCegarLoop]: 439 mSDtfsCounter, 447 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:53,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 1492 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-04-05 04:11:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-04-05 04:11:53,982 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-04-05 04:11:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-04-05 04:11:53,983 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-04-05 04:11:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:53,983 INFO L478 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-04-05 04:11:53,983 INFO L479 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-04-05 04:11:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-04-05 04:11:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:53,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:53,984 INFO L499 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-04-05 04:11:53,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-05 04:11:53,984 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-04-05 04:11:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:53,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359466835] [2022-04-05 04:11:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:54,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359466835] [2022-04-05 04:11:54,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359466835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:54,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:54,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650731047] [2022-04-05 04:11:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:54,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:54,126 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-04-05 04:11:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:55,199 INFO L93 Difference]: Finished difference Result 647 states and 817 transitions. [2022-04-05 04:11:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:55,199 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-04-05 04:11:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:55,201 INFO L225 Difference]: With dead ends: 647 [2022-04-05 04:11:55,201 INFO L226 Difference]: Without dead ends: 647 [2022-04-05 04:11:55,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:55,202 INFO L913 BasicCegarLoop]: 400 mSDtfsCounter, 469 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:55,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 1052 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:11:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-04-05 04:11:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-04-05 04:11:55,208 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-04-05 04:11:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-04-05 04:11:55,209 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-04-05 04:11:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:55,209 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-04-05 04:11:55,209 INFO L479 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-04-05 04:11:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-04-05 04:11:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:55,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:55,210 INFO L499 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-04-05 04:11:55,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-05 04:11:55,210 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-04-05 04:11:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:55,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737633548] [2022-04-05 04:11:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737633548] [2022-04-05 04:11:55,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737633548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:55,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:55,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807544095] [2022-04-05 04:11:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:55,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:55,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:55,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:55,463 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-04-05 04:11:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:56,211 INFO L93 Difference]: Finished difference Result 677 states and 864 transitions. [2022-04-05 04:11:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:56,211 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-04-05 04:11:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:56,213 INFO L225 Difference]: With dead ends: 677 [2022-04-05 04:11:56,213 INFO L226 Difference]: Without dead ends: 676 [2022-04-05 04:11:56,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:56,214 INFO L913 BasicCegarLoop]: 397 mSDtfsCounter, 1159 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:56,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 800 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:11:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-04-05 04:11:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-04-05 04:11:56,220 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-04-05 04:11:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-04-05 04:11:56,221 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-04-05 04:11:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:56,221 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-04-05 04:11:56,222 INFO L479 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-04-05 04:11:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-04-05 04:11:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:56,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:56,222 INFO L499 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-04-05 04:11:56,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-05 04:11:56,223 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-04-05 04:11:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:56,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612077682] [2022-04-05 04:11:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612077682] [2022-04-05 04:11:56,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612077682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:56,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:56,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624408041] [2022-04-05 04:11:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:56,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:56,385 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-04-05 04:11:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:57,648 INFO L93 Difference]: Finished difference Result 670 states and 844 transitions. [2022-04-05 04:11:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:11:57,649 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-04-05 04:11:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:57,651 INFO L225 Difference]: With dead ends: 670 [2022-04-05 04:11:57,651 INFO L226 Difference]: Without dead ends: 670 [2022-04-05 04:11:57,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-04-05 04:11:57,652 INFO L913 BasicCegarLoop]: 399 mSDtfsCounter, 766 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-04-05 04:11:57,652 INFO L914 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-04-05 04:11:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-04-05 04:11:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-04-05 04:11:57,666 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-04-05 04:11:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-04-05 04:11:57,667 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-04-05 04:11:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:57,668 INFO L478 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-04-05 04:11:57,668 INFO L479 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-04-05 04:11:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-04-05 04:11:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:57,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:57,669 INFO L499 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-04-05 04:11:57,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-05 04:11:57,669 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-04-05 04:11:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:57,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922400348] [2022-04-05 04:11:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922400348] [2022-04-05 04:11:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922400348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171935692] [2022-04-05 04:11:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:57,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:57,806 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-04-05 04:11:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:58,433 INFO L93 Difference]: Finished difference Result 800 states and 1032 transitions. [2022-04-05 04:11:58,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:58,433 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-04-05 04:11:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:58,448 INFO L225 Difference]: With dead ends: 800 [2022-04-05 04:11:58,448 INFO L226 Difference]: Without dead ends: 738 [2022-04-05 04:11:58,449 INFO L912 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-04-05 04:11:58,449 INFO L913 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-04-05 04:11:58,450 INFO L914 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-04-05 04:11:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-04-05 04:11:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-04-05 04:11:58,457 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-04-05 04:11:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-04-05 04:11:58,457 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-04-05 04:11:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:58,458 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-04-05 04:11:58,458 INFO L479 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-04-05 04:11:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-04-05 04:11:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-05 04:11:58,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:58,458 INFO L499 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-04-05 04:11:58,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-05 04:11:58,459 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-04-05 04:11:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:58,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431533719] [2022-04-05 04:11:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:58,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431533719] [2022-04-05 04:11:58,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431533719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:58,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:58,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465181338] [2022-04-05 04:11:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:58,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:58,655 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-04-05 04:11:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:59,862 INFO L93 Difference]: Finished difference Result 635 states and 815 transitions. [2022-04-05 04:11:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:59,866 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-04-05 04:11:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:59,868 INFO L225 Difference]: With dead ends: 635 [2022-04-05 04:11:59,868 INFO L226 Difference]: Without dead ends: 634 [2022-04-05 04:11:59,868 INFO L912 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-04-05 04:11:59,868 INFO L913 BasicCegarLoop]: 410 mSDtfsCounter, 270 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:59,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1768 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 04:11:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-04-05 04:11:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-04-05 04:11:59,875 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-04-05 04:11:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-04-05 04:11:59,876 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-04-05 04:11:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:59,876 INFO L478 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-04-05 04:11:59,876 INFO L479 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-04-05 04:11:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-04-05 04:11:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-05 04:11:59,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:59,877 INFO L499 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-04-05 04:11:59,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-05 04:11:59,877 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-04-05 04:11:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:59,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806095702] [2022-04-05 04:11:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:00,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806095702] [2022-04-05 04:12:00,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806095702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:00,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:00,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:12:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458976254] [2022-04-05 04:12:00,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:00,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:12:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:12:00,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:12:00,024 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-04-05 04:12:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:00,978 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2022-04-05 04:12:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:00,979 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-04-05 04:12:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:00,984 INFO L225 Difference]: With dead ends: 623 [2022-04-05 04:12:00,984 INFO L226 Difference]: Without dead ends: 611 [2022-04-05 04:12:00,985 INFO L912 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-04-05 04:12:00,985 INFO L913 BasicCegarLoop]: 414 mSDtfsCounter, 378 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-04-05 04:12:00,985 INFO L914 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-04-05 04:12:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-05 04:12:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-04-05 04:12:00,992 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-04-05 04:12:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-04-05 04:12:00,993 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-04-05 04:12:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:00,993 INFO L478 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-04-05 04:12:00,993 INFO L479 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-04-05 04:12:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-04-05 04:12:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-05 04:12:00,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:00,998 INFO L499 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-04-05 04:12:00,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-05 04:12:00,998 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-04-05 04:12:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:00,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640023007] [2022-04-05 04:12:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:12:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:12:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:01,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640023007] [2022-04-05 04:12:01,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640023007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:01,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:01,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532370793] [2022-04-05 04:12:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:01,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:01,185 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-04-05 04:12:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:02,235 INFO L93 Difference]: Finished difference Result 621 states and 787 transitions. [2022-04-05 04:12:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:02,235 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-04-05 04:12:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:02,237 INFO L225 Difference]: With dead ends: 621 [2022-04-05 04:12:02,237 INFO L226 Difference]: Without dead ends: 596 [2022-04-05 04:12:02,237 INFO L912 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-04-05 04:12:02,237 INFO L913 BasicCegarLoop]: 408 mSDtfsCounter, 365 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:02,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1727 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:12:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-04-05 04:12:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-04-05 04:12:02,243 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-04-05 04:12:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-04-05 04:12:02,244 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-04-05 04:12:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:02,244 INFO L478 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-04-05 04:12:02,244 INFO L479 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-04-05 04:12:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-04-05 04:12:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-05 04:12:02,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:02,245 INFO L499 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-04-05 04:12:02,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-05 04:12:02,245 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-04-05 04:12:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:02,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980574487] [2022-04-05 04:12:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980574487] [2022-04-05 04:12:02,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980574487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:02,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:02,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:12:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086893424] [2022-04-05 04:12:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:02,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:12:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:12:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:12:02,415 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-04-05 04:12:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:03,959 INFO L93 Difference]: Finished difference Result 742 states and 964 transitions. [2022-04-05 04:12:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:12:03,960 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-04-05 04:12:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:03,962 INFO L225 Difference]: With dead ends: 742 [2022-04-05 04:12:03,962 INFO L226 Difference]: Without dead ends: 728 [2022-04-05 04:12:03,962 INFO L912 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-04-05 04:12:03,962 INFO L913 BasicCegarLoop]: 503 mSDtfsCounter, 879 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:03,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 972 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-05 04:12:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-05 04:12:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-04-05 04:12:03,968 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-04-05 04:12:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-04-05 04:12:03,969 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-04-05 04:12:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:03,969 INFO L478 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-04-05 04:12:03,969 INFO L479 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-04-05 04:12:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-04-05 04:12:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-05 04:12:03,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:03,970 INFO L499 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-04-05 04:12:03,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-05 04:12:03,970 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-04-05 04:12:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:03,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359022541] [2022-04-05 04:12:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-05 04:12:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 04:12:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359022541] [2022-04-05 04:12:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359022541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:04,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:12:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926701583] [2022-04-05 04:12:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:04,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:12:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:12:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:12:04,129 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-04-05 04:12:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:04,670 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2022-04-05 04:12:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:12:04,670 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-04-05 04:12:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:04,672 INFO L225 Difference]: With dead ends: 589 [2022-04-05 04:12:04,672 INFO L226 Difference]: Without dead ends: 589 [2022-04-05 04:12:04,672 INFO L912 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-04-05 04:12:04,672 INFO L913 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-04-05 04:12:04,672 INFO L914 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-04-05 04:12:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-04-05 04:12:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-04-05 04:12:04,678 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-04-05 04:12:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-04-05 04:12:04,678 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-04-05 04:12:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:04,679 INFO L478 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-04-05 04:12:04,679 INFO L479 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-04-05 04:12:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-04-05 04:12:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 04:12:04,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:04,679 INFO L499 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-04-05 04:12:04,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-05 04:12:04,680 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-04-05 04:12:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:04,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805779724] [2022-04-05 04:12:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-05 04:12:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:04,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805779724] [2022-04-05 04:12:04,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805779724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:04,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:04,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:12:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565574339] [2022-04-05 04:12:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:04,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:12:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:12:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:12:04,841 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-04-05 04:12:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:05,510 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2022-04-05 04:12:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:12:05,511 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-04-05 04:12:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:05,512 INFO L225 Difference]: With dead ends: 538 [2022-04-05 04:12:05,512 INFO L226 Difference]: Without dead ends: 538 [2022-04-05 04:12:05,512 INFO L912 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-04-05 04:12:05,513 INFO L913 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-04-05 04:12:05,513 INFO L914 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-04-05 04:12:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-05 04:12:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-04-05 04:12:05,525 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-04-05 04:12:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-04-05 04:12:05,526 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-04-05 04:12:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:05,526 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-04-05 04:12:05,526 INFO L479 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-04-05 04:12:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-04-05 04:12:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-05 04:12:05,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:05,528 INFO L499 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-04-05 04:12:05,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-05 04:12:05,528 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-04-05 04:12:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979318943] [2022-04-05 04:12:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 04:12:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:05,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-04-05 04:12:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:05,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979318943] [2022-04-05 04:12:05,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979318943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:05,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:05,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333260983] [2022-04-05 04:12:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:05,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:05,704 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-04-05 04:12:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:06,868 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2022-04-05 04:12:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:12:06,868 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-04-05 04:12:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:06,870 INFO L225 Difference]: With dead ends: 542 [2022-04-05 04:12:06,870 INFO L226 Difference]: Without dead ends: 524 [2022-04-05 04:12:06,870 INFO L912 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-04-05 04:12:06,870 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 575 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:06,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1191 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 04:12:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-05 04:12:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-04-05 04:12:06,875 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-04-05 04:12:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-04-05 04:12:06,875 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-04-05 04:12:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:06,876 INFO L478 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-04-05 04:12:06,876 INFO L479 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-04-05 04:12:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-04-05 04:12:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-05 04:12:06,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:06,877 INFO L499 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-04-05 04:12:06,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-05 04:12:06,877 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-04-05 04:12:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632100586] [2022-04-05 04:12:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:06,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-05 04:12:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:07,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:07,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632100586] [2022-04-05 04:12:07,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632100586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:07,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:07,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:12:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930574557] [2022-04-05 04:12:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:07,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:12:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:12:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:12:07,022 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-04-05 04:12:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:07,868 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2022-04-05 04:12:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:12:07,869 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-04-05 04:12:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:07,870 INFO L225 Difference]: With dead ends: 535 [2022-04-05 04:12:07,870 INFO L226 Difference]: Without dead ends: 520 [2022-04-05 04:12:07,870 INFO L912 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-04-05 04:12:07,871 INFO L913 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-04-05 04:12:07,871 INFO L914 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-04-05 04:12:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-04-05 04:12:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-04-05 04:12:07,875 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-04-05 04:12:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-04-05 04:12:07,876 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-04-05 04:12:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:07,876 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-04-05 04:12:07,876 INFO L479 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-04-05 04:12:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-04-05 04:12:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-05 04:12:07,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:07,877 INFO L499 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-04-05 04:12:07,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-05 04:12:07,877 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-04-05 04:12:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:07,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522050400] [2022-04-05 04:12:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 04:12:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:12:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:08,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-04-05 04:12:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:08,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522050400] [2022-04-05 04:12:08,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522050400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:08,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:08,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:12:08,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830068661] [2022-04-05 04:12:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:08,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:12:08,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:08,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:12:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:12:08,034 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-04-05 04:12:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:09,053 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2022-04-05 04:12:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:09,053 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-04-05 04:12:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:09,055 INFO L225 Difference]: With dead ends: 536 [2022-04-05 04:12:09,055 INFO L226 Difference]: Without dead ends: 515 [2022-04-05 04:12:09,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:09,055 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:09,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 876 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:12:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-05 04:12:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-04-05 04:12:09,060 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-04-05 04:12:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-04-05 04:12:09,061 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-04-05 04:12:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:09,061 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-04-05 04:12:09,061 INFO L479 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-04-05 04:12:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-04-05 04:12:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-05 04:12:09,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:09,062 INFO L499 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-04-05 04:12:09,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-05 04:12:09,062 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-04-05 04:12:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929707072] [2022-04-05 04:12:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-05 04:12:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929707072] [2022-04-05 04:12:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929707072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:09,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:09,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:12:09,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728696377] [2022-04-05 04:12:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:09,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:12:09,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:12:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:12:09,210 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-04-05 04:12:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:10,155 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2022-04-05 04:12:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:10,155 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-04-05 04:12:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:10,157 INFO L225 Difference]: With dead ends: 521 [2022-04-05 04:12:10,157 INFO L226 Difference]: Without dead ends: 521 [2022-04-05 04:12:10,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:12:10,167 INFO L913 BasicCegarLoop]: 357 mSDtfsCounter, 757 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:10,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1011 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:12:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-05 04:12:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-04-05 04:12:10,175 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-04-05 04:12:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-04-05 04:12:10,176 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-04-05 04:12:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:10,178 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-04-05 04:12:10,178 INFO L479 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-04-05 04:12:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-04-05 04:12:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:12:10,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:10,179 INFO L499 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-04-05 04:12:10,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-05 04:12:10,179 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:10,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-04-05 04:12:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:10,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377743172] [2022-04-05 04:12:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377743172] [2022-04-05 04:12:10,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377743172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:10,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:10,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:12:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961153869] [2022-04-05 04:12:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:10,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:12:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:12:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:12:10,329 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-04-05 04:12:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:11,269 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2022-04-05 04:12:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:12:11,270 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-04-05 04:12:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:11,271 INFO L225 Difference]: With dead ends: 519 [2022-04-05 04:12:11,271 INFO L226 Difference]: Without dead ends: 519 [2022-04-05 04:12:11,272 INFO L912 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-04-05 04:12:11,272 INFO L913 BasicCegarLoop]: 359 mSDtfsCounter, 321 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:11,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 754 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:12:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-04-05 04:12:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-04-05 04:12:11,276 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-04-05 04:12:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-04-05 04:12:11,277 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-04-05 04:12:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:11,277 INFO L478 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-04-05 04:12:11,278 INFO L479 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-04-05 04:12:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-04-05 04:12:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:12:11,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:11,278 INFO L499 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-04-05 04:12:11,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-05 04:12:11,279 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-04-05 04:12:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:11,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318714690] [2022-04-05 04:12:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318714690] [2022-04-05 04:12:11,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318714690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:11,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:11,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:12:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088610480] [2022-04-05 04:12:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:11,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:12:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:12:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:12:11,452 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-04-05 04:12:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:12,487 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2022-04-05 04:12:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:12,488 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-04-05 04:12:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:12,489 INFO L225 Difference]: With dead ends: 505 [2022-04-05 04:12:12,489 INFO L226 Difference]: Without dead ends: 505 [2022-04-05 04:12:12,489 INFO L912 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-04-05 04:12:12,489 INFO L913 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-04-05 04:12:12,490 INFO L914 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-04-05 04:12:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-05 04:12:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-04-05 04:12:12,493 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-04-05 04:12:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-04-05 04:12:12,494 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-04-05 04:12:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:12,494 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-04-05 04:12:12,494 INFO L479 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-04-05 04:12:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-04-05 04:12:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-05 04:12:12,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:12,495 INFO L499 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-04-05 04:12:12,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-05 04:12:12,495 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-04-05 04:12:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:12,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829279435] [2022-04-05 04:12:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-05 04:12:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829279435] [2022-04-05 04:12:12,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829279435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:12,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:12,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:12:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632596929] [2022-04-05 04:12:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:12,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:12:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:12:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:12:12,688 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-04-05 04:12:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:13,441 INFO L93 Difference]: Finished difference Result 524 states and 652 transitions. [2022-04-05 04:12:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 04:12:13,442 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-04-05 04:12:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:13,443 INFO L225 Difference]: With dead ends: 524 [2022-04-05 04:12:13,443 INFO L226 Difference]: Without dead ends: 524 [2022-04-05 04:12:13,443 INFO L912 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-04-05 04:12:13,444 INFO L913 BasicCegarLoop]: 375 mSDtfsCounter, 556 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:13,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1312 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:12:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-05 04:12:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-04-05 04:12:13,448 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-04-05 04:12:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-04-05 04:12:13,449 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-04-05 04:12:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:13,449 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-04-05 04:12:13,449 INFO L479 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-04-05 04:12:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-04-05 04:12:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 04:12:13,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:13,450 INFO L499 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-04-05 04:12:13,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-05 04:12:13,450 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-04-05 04:12:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057257624] [2022-04-05 04:12:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:13,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057257624] [2022-04-05 04:12:13,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057257624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:13,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:13,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026650308] [2022-04-05 04:12:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:13,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:13,607 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-04-05 04:12:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:14,471 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2022-04-05 04:12:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:14,471 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-04-05 04:12:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:14,473 INFO L225 Difference]: With dead ends: 519 [2022-04-05 04:12:14,473 INFO L226 Difference]: Without dead ends: 501 [2022-04-05 04:12:14,473 INFO L912 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-04-05 04:12:14,473 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:14,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1611 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:12:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-05 04:12:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-04-05 04:12:14,477 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-04-05 04:12:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-04-05 04:12:14,478 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-04-05 04:12:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:14,478 INFO L478 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-04-05 04:12:14,478 INFO L479 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-04-05 04:12:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-04-05 04:12:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 04:12:14,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:14,479 INFO L499 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-04-05 04:12:14,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-05 04:12:14,479 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-04-05 04:12:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:14,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431110960] [2022-04-05 04:12:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 04:12:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:14,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431110960] [2022-04-05 04:12:14,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431110960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:14,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:14,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:12:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449050406] [2022-04-05 04:12:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:14,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:12:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:12:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:12:14,642 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-04-05 04:12:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:15,509 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2022-04-05 04:12:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:15,509 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-04-05 04:12:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:15,511 INFO L225 Difference]: With dead ends: 509 [2022-04-05 04:12:15,511 INFO L226 Difference]: Without dead ends: 490 [2022-04-05 04:12:15,511 INFO L912 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-04-05 04:12:15,511 INFO L913 BasicCegarLoop]: 375 mSDtfsCounter, 315 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:15,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1452 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:12:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-04-05 04:12:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-04-05 04:12:15,515 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-04-05 04:12:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-04-05 04:12:15,516 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-04-05 04:12:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:15,516 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-04-05 04:12:15,516 INFO L479 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-04-05 04:12:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-04-05 04:12:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 04:12:15,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:15,517 INFO L499 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-04-05 04:12:15,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-05 04:12:15,517 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-04-05 04:12:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:15,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949921129] [2022-04-05 04:12:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949921129] [2022-04-05 04:12:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949921129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444588440] [2022-04-05 04:12:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:15,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:15,668 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-04-05 04:12:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:16,643 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2022-04-05 04:12:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:16,644 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-04-05 04:12:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:16,645 INFO L225 Difference]: With dead ends: 504 [2022-04-05 04:12:16,645 INFO L226 Difference]: Without dead ends: 485 [2022-04-05 04:12:16,645 INFO L912 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-04-05 04:12:16,645 INFO L913 BasicCegarLoop]: 367 mSDtfsCounter, 293 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-04-05 04:12:16,646 INFO L914 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-04-05 04:12:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-04-05 04:12:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-04-05 04:12:16,649 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-04-05 04:12:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-04-05 04:12:16,650 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-04-05 04:12:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:16,650 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-04-05 04:12:16,650 INFO L479 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-04-05 04:12:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-04-05 04:12:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 04:12:16,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:16,651 INFO L499 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-04-05 04:12:16,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-05 04:12:16,651 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-04-05 04:12:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:16,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489624647] [2022-04-05 04:12:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489624647] [2022-04-05 04:12:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489624647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:16,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:16,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385420100] [2022-04-05 04:12:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:16,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:16,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:16,804 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-04-05 04:12:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:17,549 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2022-04-05 04:12:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:17,549 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-04-05 04:12:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:17,550 INFO L225 Difference]: With dead ends: 499 [2022-04-05 04:12:17,550 INFO L226 Difference]: Without dead ends: 481 [2022-04-05 04:12:17,550 INFO L912 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-04-05 04:12:17,551 INFO L913 BasicCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:17,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1473 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:12:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-04-05 04:12:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-04-05 04:12:17,554 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-04-05 04:12:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-04-05 04:12:17,555 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-04-05 04:12:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:17,555 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-04-05 04:12:17,555 INFO L479 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-04-05 04:12:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-04-05 04:12:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-05 04:12:17,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:17,556 INFO L499 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-04-05 04:12:17,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-05 04:12:17,556 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-04-05 04:12:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678572353] [2022-04-05 04:12:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-05 04:12:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678572353] [2022-04-05 04:12:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678572353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:17,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:17,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:12:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393549809] [2022-04-05 04:12:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:17,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:12:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:12:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:12:17,689 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-04-05 04:12:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:18,215 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2022-04-05 04:12:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:12:18,216 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-04-05 04:12:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:18,217 INFO L225 Difference]: With dead ends: 625 [2022-04-05 04:12:18,217 INFO L226 Difference]: Without dead ends: 625 [2022-04-05 04:12:18,217 INFO L912 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-04-05 04:12:18,218 INFO L913 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-04-05 04:12:18,218 INFO L914 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-04-05 04:12:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-04-05 04:12:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-04-05 04:12:18,223 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-04-05 04:12:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-04-05 04:12:18,223 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-04-05 04:12:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:18,224 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-04-05 04:12:18,224 INFO L479 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-04-05 04:12:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-04-05 04:12:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-05 04:12:18,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:18,225 INFO L499 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-04-05 04:12:18,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-05 04:12:18,225 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-04-05 04:12:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:18,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434085267] [2022-04-05 04:12:18,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-05 04:12:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434085267] [2022-04-05 04:12:18,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434085267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:18,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:18,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676596323] [2022-04-05 04:12:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:18,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:18,383 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-04-05 04:12:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:19,211 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2022-04-05 04:12:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:12:19,212 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-04-05 04:12:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:19,213 INFO L225 Difference]: With dead ends: 616 [2022-04-05 04:12:19,213 INFO L226 Difference]: Without dead ends: 576 [2022-04-05 04:12:19,214 INFO L912 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-04-05 04:12:19,214 INFO L913 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.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:19,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1438 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:12:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-04-05 04:12:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-04-05 04:12:19,221 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-04-05 04:12:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-04-05 04:12:19,222 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-04-05 04:12:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:19,222 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-04-05 04:12:19,222 INFO L479 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-04-05 04:12:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-04-05 04:12:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-05 04:12:19,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:19,223 INFO L499 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-04-05 04:12:19,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-05 04:12:19,223 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:19,224 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-04-05 04:12:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:19,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487625012] [2022-04-05 04:12:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:12:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-05 04:12:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:19,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487625012] [2022-04-05 04:12:19,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487625012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:19,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:19,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:12:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498697414] [2022-04-05 04:12:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:19,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:12:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:12:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:19,442 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-04-05 04:12:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:20,556 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2022-04-05 04:12:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-05 04:12:20,556 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-04-05 04:12:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:20,558 INFO L225 Difference]: With dead ends: 586 [2022-04-05 04:12:20,558 INFO L226 Difference]: Without dead ends: 535 [2022-04-05 04:12:20,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:12:20,558 INFO L913 BasicCegarLoop]: 305 mSDtfsCounter, 488 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:20,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 901 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:12:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-04-05 04:12:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-04-05 04:12:20,562 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-04-05 04:12:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-04-05 04:12:20,563 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-04-05 04:12:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:20,563 INFO L478 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-04-05 04:12:20,563 INFO L479 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-04-05 04:12:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-04-05 04:12:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-05 04:12:20,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:20,564 INFO L499 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-04-05 04:12:20,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-05 04:12:20,564 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-04-05 04:12:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:20,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171762452] [2022-04-05 04:12:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:20,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-05 04:12:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:12:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:20,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171762452] [2022-04-05 04:12:20,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171762452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:20,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:20,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:12:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828776798] [2022-04-05 04:12:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:20,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:12:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:12:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:12:20,705 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-04-05 04:12:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:21,558 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2022-04-05 04:12:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:12:21,559 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-04-05 04:12:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:21,560 INFO L225 Difference]: With dead ends: 523 [2022-04-05 04:12:21,560 INFO L226 Difference]: Without dead ends: 523 [2022-04-05 04:12:21,560 INFO L912 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-04-05 04:12:21,560 INFO L913 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-04-05 04:12:21,561 INFO L914 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-04-05 04:12:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-05 04:12:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-04-05 04:12:21,565 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-04-05 04:12:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-04-05 04:12:21,565 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-04-05 04:12:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:21,565 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-04-05 04:12:21,566 INFO L479 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-04-05 04:12:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-04-05 04:12:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-05 04:12:21,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:21,566 INFO L499 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-04-05 04:12:21,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-05 04:12:21,566 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-04-05 04:12:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101612234] [2022-04-05 04:12:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-05 04:12:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-05 04:12:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101612234] [2022-04-05 04:12:21,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101612234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:21,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257068573] [2022-04-05 04:12:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:21,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:21,780 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-04-05 04:12:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:22,500 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2022-04-05 04:12:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-05 04:12:22,500 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-04-05 04:12:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:22,501 INFO L225 Difference]: With dead ends: 585 [2022-04-05 04:12:22,501 INFO L226 Difference]: Without dead ends: 585 [2022-04-05 04:12:22,502 INFO L912 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-04-05 04:12:22,502 INFO L913 BasicCegarLoop]: 339 mSDtfsCounter, 453 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:22,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1652 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:12:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-04-05 04:12:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-04-05 04:12:22,506 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-04-05 04:12:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-04-05 04:12:22,507 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-04-05 04:12:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:22,507 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-04-05 04:12:22,507 INFO L479 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-04-05 04:12:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-04-05 04:12:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-05 04:12:22,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:22,508 INFO L499 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-04-05 04:12:22,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-05 04:12:22,508 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-04-05 04:12:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:22,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075916665] [2022-04-05 04:12:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 04:12:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075916665] [2022-04-05 04:12:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075916665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:22,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:22,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-05 04:12:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892652064] [2022-04-05 04:12:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:22,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-05 04:12:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-05 04:12:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:12:22,699 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-04-05 04:12:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:23,433 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2022-04-05 04:12:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 04:12:23,434 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-04-05 04:12:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:23,435 INFO L225 Difference]: With dead ends: 523 [2022-04-05 04:12:23,435 INFO L226 Difference]: Without dead ends: 505 [2022-04-05 04:12:23,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:12:23,435 INFO L913 BasicCegarLoop]: 289 mSDtfsCounter, 571 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:23,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 1556 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:12:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-05 04:12:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-04-05 04:12:23,439 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-04-05 04:12:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-04-05 04:12:23,440 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-04-05 04:12:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:23,440 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-04-05 04:12:23,440 INFO L479 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-04-05 04:12:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-04-05 04:12:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-05 04:12:23,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:23,441 INFO L499 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-04-05 04:12:23,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-05 04:12:23,441 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-04-05 04:12:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547731838] [2022-04-05 04:12:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-05 04:12:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547731838] [2022-04-05 04:12:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547731838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:23,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:23,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-05 04:12:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863264457] [2022-04-05 04:12:23,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:23,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-05 04:12:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-05 04:12:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:12:23,719 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-04-05 04:12:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:24,524 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2022-04-05 04:12:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 04:12:24,525 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-04-05 04:12:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:24,526 INFO L225 Difference]: With dead ends: 523 [2022-04-05 04:12:24,526 INFO L226 Difference]: Without dead ends: 505 [2022-04-05 04:12:24,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:12:24,527 INFO L913 BasicCegarLoop]: 305 mSDtfsCounter, 251 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:24,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1738 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:12:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-05 04:12:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-04-05 04:12:24,530 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-04-05 04:12:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-04-05 04:12:24,531 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-04-05 04:12:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:24,531 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-04-05 04:12:24,531 INFO L479 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-04-05 04:12:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-04-05 04:12:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-05 04:12:24,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:24,532 INFO L499 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-04-05 04:12:24,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-05 04:12:24,532 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-04-05 04:12:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:24,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687938919] [2022-04-05 04:12:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:12:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-05 04:12:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687938919] [2022-04-05 04:12:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687938919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:24,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622223258] [2022-04-05 04:12:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:24,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:24,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:24,693 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-04-05 04:12:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:25,261 INFO L93 Difference]: Finished difference Result 485 states and 577 transitions. [2022-04-05 04:12:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:12:25,261 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-04-05 04:12:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:25,262 INFO L225 Difference]: With dead ends: 485 [2022-04-05 04:12:25,263 INFO L226 Difference]: Without dead ends: 483 [2022-04-05 04:12:25,263 INFO L912 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-04-05 04:12:25,263 INFO L913 BasicCegarLoop]: 274 mSDtfsCounter, 390 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:25,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1158 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:12:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-04-05 04:12:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-04-05 04:12:25,267 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-04-05 04:12:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-04-05 04:12:25,267 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-04-05 04:12:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:25,267 INFO L478 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-04-05 04:12:25,267 INFO L479 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-04-05 04:12:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-04-05 04:12:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-05 04:12:25,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:25,268 INFO L499 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-04-05 04:12:25,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-05 04:12:25,268 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-04-05 04:12:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700082086] [2022-04-05 04:12:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 04:12:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-05 04:12:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-05 04:12:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700082086] [2022-04-05 04:12:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700082086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:25,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:12:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863338742] [2022-04-05 04:12:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:25,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:12:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:12:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:12:25,447 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-04-05 04:12:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:27,349 INFO L93 Difference]: Finished difference Result 1310 states and 1519 transitions. [2022-04-05 04:12:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-05 04:12:27,349 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-04-05 04:12:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:27,351 INFO L225 Difference]: With dead ends: 1310 [2022-04-05 04:12:27,351 INFO L226 Difference]: Without dead ends: 1310 [2022-04-05 04:12:27,352 INFO L912 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-04-05 04:12:27,353 INFO L913 BasicCegarLoop]: 577 mSDtfsCounter, 1541 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:27,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 839 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-05 04:12:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-04-05 04:12:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-04-05 04:12:27,363 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-04-05 04:12:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-04-05 04:12:27,364 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-04-05 04:12:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:27,364 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-04-05 04:12:27,364 INFO L479 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-04-05 04:12:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-04-05 04:12:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-05 04:12:27,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:27,365 INFO L499 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-04-05 04:12:27,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-05 04:12:27,366 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-04-05 04:12:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:27,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541061297] [2022-04-05 04:12:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 04:12:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-05 04:12:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541061297] [2022-04-05 04:12:27,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541061297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:27,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:27,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:12:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972097722] [2022-04-05 04:12:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:27,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:12:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:12:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:27,581 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-04-05 04:12:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:28,827 INFO L93 Difference]: Finished difference Result 1959 states and 2303 transitions. [2022-04-05 04:12:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-05 04:12:28,828 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-04-05 04:12:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:28,831 INFO L225 Difference]: With dead ends: 1959 [2022-04-05 04:12:28,831 INFO L226 Difference]: Without dead ends: 1897 [2022-04-05 04:12:28,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-04-05 04:12:28,832 INFO L913 BasicCegarLoop]: 461 mSDtfsCounter, 516 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:28,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 1948 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-05 04:12:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-04-05 04:12:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-04-05 04:12:28,849 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-04-05 04:12:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-04-05 04:12:28,850 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-04-05 04:12:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:28,851 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-04-05 04:12:28,851 INFO L479 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-04-05 04:12:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-04-05 04:12:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-05 04:12:28,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:28,852 INFO L499 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-04-05 04:12:28,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-05 04:12:28,852 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1879720238, now seen corresponding path program 1 times [2022-04-05 04:12:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:28,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440596751] [2022-04-05 04:12:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 04:12:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-05 04:12:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:12:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:29,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440596751] [2022-04-05 04:12:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440596751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:29,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-05 04:12:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410007636] [2022-04-05 04:12:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:29,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-05 04:12:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-05 04:12:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:12:29,021 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-04-05 04:12:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:29,862 INFO L93 Difference]: Finished difference Result 1007 states and 1173 transitions. [2022-04-05 04:12:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 04:12:29,862 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-04-05 04:12:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:29,864 INFO L225 Difference]: With dead ends: 1007 [2022-04-05 04:12:29,864 INFO L226 Difference]: Without dead ends: 804 [2022-04-05 04:12:29,864 INFO L912 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-04-05 04:12:29,864 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 297 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-04-05 04:12:29,864 INFO L914 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-04-05 04:12:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-04-05 04:12:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-04-05 04:12:29,870 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-04-05 04:12:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-04-05 04:12:29,871 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-04-05 04:12:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:29,871 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-04-05 04:12:29,871 INFO L479 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-04-05 04:12:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-04-05 04:12:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-05 04:12:29,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:29,872 INFO L499 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-04-05 04:12:29,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-05 04:12:29,872 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-04-05 04:12:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993550044] [2022-04-05 04:12:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 04:12:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993550044] [2022-04-05 04:12:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993550044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:30,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:30,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-05 04:12:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145320082] [2022-04-05 04:12:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:30,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-05 04:12:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-05 04:12:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:12:30,117 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-04-05 04:12:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:30,579 INFO L93 Difference]: Finished difference Result 872 states and 1024 transitions. [2022-04-05 04:12:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 04:12:30,579 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-04-05 04:12:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:30,591 INFO L225 Difference]: With dead ends: 872 [2022-04-05 04:12:30,591 INFO L226 Difference]: Without dead ends: 834 [2022-04-05 04:12:30,591 INFO L912 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-04-05 04:12:30,591 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:30,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 1187 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:12:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-05 04:12:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-04-05 04:12:30,598 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-04-05 04:12:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-04-05 04:12:30,599 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-04-05 04:12:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:30,599 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-04-05 04:12:30,599 INFO L479 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-04-05 04:12:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-04-05 04:12:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-05 04:12:30,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:30,601 INFO L499 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-04-05 04:12:30,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-05 04:12:30,601 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-04-05 04:12:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:30,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629573724] [2022-04-05 04:12:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-05 04:12:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-05 04:12:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-05 04:12:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:30,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629573724] [2022-04-05 04:12:30,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629573724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:30,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:30,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 04:12:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939309470] [2022-04-05 04:12:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:30,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 04:12:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 04:12:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:12:30,758 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-04-05 04:12:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:31,063 INFO L93 Difference]: Finished difference Result 717 states and 809 transitions. [2022-04-05 04:12:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 04:12:31,063 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-04-05 04:12:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:31,064 INFO L225 Difference]: With dead ends: 717 [2022-04-05 04:12:31,064 INFO L226 Difference]: Without dead ends: 717 [2022-04-05 04:12:31,065 INFO L912 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-04-05 04:12:31,065 INFO L913 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.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:31,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 805 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:12:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-04-05 04:12:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-04-05 04:12:31,069 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-04-05 04:12:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-04-05 04:12:31,070 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-04-05 04:12:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:31,070 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-04-05 04:12:31,070 INFO L479 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-04-05 04:12:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-04-05 04:12:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-05 04:12:31,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:31,071 INFO L499 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-04-05 04:12:31,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-05 04:12:31,071 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-04-05 04:12:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:31,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943765385] [2022-04-05 04:12:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 04:12:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:12:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943765385] [2022-04-05 04:12:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943765385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:31,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:31,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:12:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648493080] [2022-04-05 04:12:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:31,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:12:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:12:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:31,266 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-04-05 04:12:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:31,574 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2022-04-05 04:12:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:31,574 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-04-05 04:12:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:31,575 INFO L225 Difference]: With dead ends: 477 [2022-04-05 04:12:31,575 INFO L226 Difference]: Without dead ends: 477 [2022-04-05 04:12:31,575 INFO L912 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-04-05 04:12:31,576 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:31,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 688 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 04:12:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-04-05 04:12:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-04-05 04:12:31,579 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-04-05 04:12:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-04-05 04:12:31,580 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-04-05 04:12:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:31,580 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-04-05 04:12:31,580 INFO L479 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-04-05 04:12:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-04-05 04:12:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-05 04:12:31,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:31,581 INFO L499 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-04-05 04:12:31,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-05 04:12:31,581 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:31,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-04-05 04:12:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:31,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535199278] [2022-04-05 04:12:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 04:12:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:12:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:12:31,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:31,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535199278] [2022-04-05 04:12:31,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535199278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:31,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:31,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:12:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523679291] [2022-04-05 04:12:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:31,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:12:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:12:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:31,785 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-04-05 04:12:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:32,254 INFO L93 Difference]: Finished difference Result 477 states and 527 transitions. [2022-04-05 04:12:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:32,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-04-05 04:12:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:32,256 INFO L225 Difference]: With dead ends: 477 [2022-04-05 04:12:32,256 INFO L226 Difference]: Without dead ends: 469 [2022-04-05 04:12:32,256 INFO L912 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-04-05 04:12:32,256 INFO L913 BasicCegarLoop]: 174 mSDtfsCounter, 132 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:32,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 783 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:12:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-05 04:12:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-04-05 04:12:32,260 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-04-05 04:12:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-04-05 04:12:32,260 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-04-05 04:12:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:32,260 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-04-05 04:12:32,260 INFO L479 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-04-05 04:12:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-04-05 04:12:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-05 04:12:32,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:32,261 INFO L499 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-04-05 04:12:32,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-05 04:12:32,262 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-04-05 04:12:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:32,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95203011] [2022-04-05 04:12:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 04:12:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-05 04:12:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-05 04:12:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95203011] [2022-04-05 04:12:32,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95203011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:32,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:32,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-05 04:12:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822807721] [2022-04-05 04:12:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:32,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-05 04:12:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-05 04:12:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:12:32,631 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-04-05 04:12:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:33,451 INFO L93 Difference]: Finished difference Result 581 states and 661 transitions. [2022-04-05 04:12:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-05 04:12:33,451 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-04-05 04:12:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:33,452 INFO L225 Difference]: With dead ends: 581 [2022-04-05 04:12:33,452 INFO L226 Difference]: Without dead ends: 531 [2022-04-05 04:12:33,452 INFO L912 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-04-05 04:12:33,452 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 198 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:33,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 1459 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:12:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-04-05 04:12:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-04-05 04:12:33,456 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-04-05 04:12:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-04-05 04:12:33,457 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-04-05 04:12:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:33,457 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-04-05 04:12:33,457 INFO L479 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-04-05 04:12:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-04-05 04:12:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-05 04:12:33,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:33,458 INFO L499 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-04-05 04:12:33,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-05 04:12:33,458 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-04-05 04:12:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:33,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298332450] [2022-04-05 04:12:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-05 04:12:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-05 04:12:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-05 04:12:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:33,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298332450] [2022-04-05 04:12:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298332450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:33,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:33,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-05 04:12:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300940924] [2022-04-05 04:12:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:33,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-05 04:12:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-05 04:12:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:12:33,714 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-04-05 04:12:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:34,324 INFO L93 Difference]: Finished difference Result 529 states and 589 transitions. [2022-04-05 04:12:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 04:12:34,324 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-04-05 04:12:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:34,325 INFO L225 Difference]: With dead ends: 529 [2022-04-05 04:12:34,325 INFO L226 Difference]: Without dead ends: 519 [2022-04-05 04:12:34,325 INFO L912 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-04-05 04:12:34,325 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 116 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:34,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1249 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:12:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-04-05 04:12:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-04-05 04:12:34,329 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-04-05 04:12:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-04-05 04:12:34,329 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-04-05 04:12:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:34,330 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-04-05 04:12:34,330 INFO L479 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-04-05 04:12:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-04-05 04:12:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-05 04:12:34,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:34,331 INFO L499 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-04-05 04:12:34,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-05 04:12:34,331 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-04-05 04:12:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:34,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992175777] [2022-04-05 04:12:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-05 04:12:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-05 04:12:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-05 04:12:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 04:12:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:34,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992175777] [2022-04-05 04:12:34,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992175777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:34,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:34,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-05 04:12:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132674752] [2022-04-05 04:12:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:34,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-05 04:12:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-05 04:12:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:12:34,651 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-04-05 04:12:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:35,260 INFO L93 Difference]: Finished difference Result 553 states and 621 transitions. [2022-04-05 04:12:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 04:12:35,261 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-04-05 04:12:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:35,262 INFO L225 Difference]: With dead ends: 553 [2022-04-05 04:12:35,262 INFO L226 Difference]: Without dead ends: 491 [2022-04-05 04:12:35,262 INFO L912 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-04-05 04:12:35,262 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:35,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1112 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:12:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-04-05 04:12:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-04-05 04:12:35,267 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-04-05 04:12:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-04-05 04:12:35,268 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-04-05 04:12:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:35,268 INFO L478 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-04-05 04:12:35,268 INFO L479 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-04-05 04:12:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-04-05 04:12:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-05 04:12:35,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:35,269 INFO L499 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-04-05 04:12:35,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-05 04:12:35,269 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-04-05 04:12:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:35,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344199503] [2022-04-05 04:12:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-05 04:12:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-04-05 04:12:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-05 04:12:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 04:12:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:35,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344199503] [2022-04-05 04:12:35,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344199503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:35,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:35,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:12:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151074571] [2022-04-05 04:12:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:35,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:12:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:12:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:12:35,567 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-04-05 04:12:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:36,046 INFO L93 Difference]: Finished difference Result 473 states and 515 transitions. [2022-04-05 04:12:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:36,047 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-04-05 04:12:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:36,049 INFO L225 Difference]: With dead ends: 473 [2022-04-05 04:12:36,049 INFO L226 Difference]: Without dead ends: 451 [2022-04-05 04:12:36,049 INFO L912 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-04-05 04:12:36,049 INFO L913 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-04-05 04:12:36,049 INFO L914 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-04-05 04:12:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-05 04:12:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-04-05 04:12:36,053 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-04-05 04:12:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-04-05 04:12:36,053 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-04-05 04:12:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:36,054 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-04-05 04:12:36,055 INFO L479 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-04-05 04:12:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-04-05 04:12:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-05 04:12:36,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:36,056 INFO L499 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-04-05 04:12:36,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-05 04:12:36,057 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-04-05 04:12:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:36,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933693338] [2022-04-05 04:12:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-05 04:12:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-05 04:12:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-05 04:12:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-05 04:12:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933693338] [2022-04-05 04:12:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933693338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-05 04:12:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591285624] [2022-04-05 04:12:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:36,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-05 04:12:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-05 04:12:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-05 04:12:36,332 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-04-05 04:12:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:36,632 INFO L93 Difference]: Finished difference Result 401 states and 431 transitions. [2022-04-05 04:12:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:12:36,632 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-04-05 04:12:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:36,633 INFO L225 Difference]: With dead ends: 401 [2022-04-05 04:12:36,633 INFO L226 Difference]: Without dead ends: 381 [2022-04-05 04:12:36,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-04-05 04:12:36,634 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-05 04:12:36,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 732 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 04:12:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-05 04:12:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-04-05 04:12:36,637 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-04-05 04:12:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-04-05 04:12:36,637 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-04-05 04:12:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:36,637 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-04-05 04:12:36,638 INFO L479 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-04-05 04:12:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-04-05 04:12:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-05 04:12:36,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:36,638 INFO L499 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-04-05 04:12:36,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-04-05 04:12:36,639 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-04-05 04:12:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19937488] [2022-04-05 04:12:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-05 04:12:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-05 04:12:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-05 04:12:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 04:12:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:36,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19937488] [2022-04-05 04:12:36,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19937488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:36,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:36,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-05 04:12:36,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904180596] [2022-04-05 04:12:36,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:36,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-05 04:12:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-05 04:12:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-04-05 04:12:36,925 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-04-05 04:12:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:37,782 INFO L93 Difference]: Finished difference Result 661 states and 706 transitions. [2022-04-05 04:12:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-05 04:12:37,782 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-04-05 04:12:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:37,783 INFO L225 Difference]: With dead ends: 661 [2022-04-05 04:12:37,783 INFO L226 Difference]: Without dead ends: 387 [2022-04-05 04:12:37,784 INFO L912 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-04-05 04:12:37,784 INFO L913 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-04-05 04:12:37,784 INFO L914 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-04-05 04:12:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-05 04:12:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-04-05 04:12:37,787 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-04-05 04:12:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-04-05 04:12:37,787 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-04-05 04:12:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:37,787 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-04-05 04:12:37,787 INFO L479 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-04-05 04:12:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-04-05 04:12:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-05 04:12:37,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:12:37,788 INFO L499 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-04-05 04:12:37,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-04-05 04:12:37,788 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:12:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:12:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-04-05 04:12:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:12:37,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808309148] [2022-04-05 04:12:37,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:12:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:12:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:12:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:12:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:12:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:12:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 04:12:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:12:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:12:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:12:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:12:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:12:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 04:12:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-05 04:12:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-05 04:12:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-05 04:12:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:12:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 04:12:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:12:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808309148] [2022-04-05 04:12:38,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808309148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:12:38,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:12:38,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-05 04:12:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277373119] [2022-04-05 04:12:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:12:38,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-05 04:12:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:12:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-05 04:12:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:12:38,128 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-04-05 04:12:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:12:39,095 INFO L93 Difference]: Finished difference Result 384 states and 413 transitions. [2022-04-05 04:12:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-05 04:12:39,095 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-04-05 04:12:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:12:39,095 INFO L225 Difference]: With dead ends: 384 [2022-04-05 04:12:39,095 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 04:12:39,096 INFO L912 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-04-05 04:12:39,096 INFO L913 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-04-05 04:12:39,096 INFO L914 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-04-05 04:12:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 04:12:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 04:12:39,096 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-04-05 04:12:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 04:12:39,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-04-05 04:12:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:12:39,097 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 04:12:39,103 INFO L479 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-04-05 04:12:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 04:12:39,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 04:12:39,105 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 04:12:39,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-04-05 04:12:39,107 INFO L719 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-04-05 04:12:39,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 04:12:39,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:12:39 BasicIcfg [2022-04-05 04:12:39,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 04:12:39,112 INFO L158 Benchmark]: Toolchain (without parser) took 72631.19ms. Allocated memory was 182.5MB in the beginning and 313.5MB in the end (delta: 131.1MB). Free memory was 133.0MB in the beginning and 213.2MB in the end (delta: -80.2MB). Peak memory consumption was 50.7MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,112 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 150.7MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 04:12:39,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.63ms. Allocated memory is still 182.5MB. Free memory was 132.8MB in the beginning and 145.6MB in the end (delta: -12.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,113 INFO L158 Benchmark]: Boogie Preprocessor took 74.80ms. Allocated memory is still 182.5MB. Free memory was 145.6MB in the beginning and 141.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,113 INFO L158 Benchmark]: RCFGBuilder took 1112.18ms. Allocated memory was 182.5MB in the beginning and 233.8MB in the end (delta: 51.4MB). Free memory was 141.4MB in the beginning and 192.1MB in the end (delta: -50.7MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,113 INFO L158 Benchmark]: IcfgTransformer took 35.86ms. Allocated memory is still 233.8MB. Free memory was 192.1MB in the beginning and 185.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,113 INFO L158 Benchmark]: TraceAbstraction took 70956.07ms. Allocated memory was 233.8MB in the beginning and 313.5MB in the end (delta: 79.7MB). Free memory was 185.3MB in the beginning and 213.2MB in the end (delta: -27.9MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. [2022-04-05 04:12:39,115 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 182.5MB. Free memory was 150.8MB in the beginning and 150.7MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.63ms. Allocated memory is still 182.5MB. Free memory was 132.8MB in the beginning and 145.6MB in the end (delta: -12.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.80ms. Allocated memory is still 182.5MB. Free memory was 145.6MB in the beginning and 141.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1112.18ms. Allocated memory was 182.5MB in the beginning and 233.8MB in the end (delta: 51.4MB). Free memory was 141.4MB in the beginning and 192.1MB in the end (delta: -50.7MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. * IcfgTransformer took 35.86ms. Allocated memory is still 233.8MB. Free memory was 192.1MB in the beginning and 185.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 70956.07ms. Allocated memory was 233.8MB in the beginning and 313.5MB in the end (delta: 79.7MB). Free memory was 185.3MB in the beginning and 213.2MB in the end (delta: -27.9MB). Peak memory consumption was 52.3MB. 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.9s, OverallIterations: 65, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 58.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37391 SdHoareTripleChecker+Valid, 49.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36907 mSDsluCounter, 72225 SdHoareTripleChecker+Invalid, 41.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47559 mSDsCounter, 11352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95305 IncrementalHoareTripleChecker+Invalid, 106657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11352 mSolverCounterUnsat, 24666 mSDtfsCounter, 95305 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.6s AutomataMinimizationTime, 65 MinimizatonAttempts, 3956 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s 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-04-05 04:12:39,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...