/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/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:37:21,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:37:21,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:37:21,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:37:21,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:37:21,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:37:21,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:37:21,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:37:21,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:37:21,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:37:21,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:37:21,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:37:21,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:37:22,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:37:22,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:37:22,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:37:22,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:37:22,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:37:22,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:37:22,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:37:22,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:37:22,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:37:22,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:37:22,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:37:22,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:37:22,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:37:22,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:37:22,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:37:22,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:37:22,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:37:22,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:37:22,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:37:22,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:37:22,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:37:22,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:37:22,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:37:22,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:37:22,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:37:22,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:37:22,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:37:22,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:37:22,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:37:22,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:37:22,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:37:22,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:37:22,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:37:22,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:37:22,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:37:22,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:37:22,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:37:22,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:37:22,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:37:22,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:37:22,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:37:22,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:37:22,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:37:22,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:37:22,044 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:37:22,044 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 00:37:22,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:37:22,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:37:22,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:37:22,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:37:22,237 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:37:22,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-02-15 00:37:22,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac00c8c/584bddcde5ed48969f8189f02af55cef/FLAG437ea7f2b [2022-02-15 00:37:22,698 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:37:22,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-02-15 00:37:22,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac00c8c/584bddcde5ed48969f8189f02af55cef/FLAG437ea7f2b [2022-02-15 00:37:22,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dac00c8c/584bddcde5ed48969f8189f02af55cef [2022-02-15 00:37:22,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:37:22,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:37:22,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:37:22,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:37:22,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:37:22,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:37:22" (1/1) ... [2022-02-15 00:37:22,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739bbba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:22, skipping insertion in model container [2022-02-15 00:37:22,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:37:22" (1/1) ... [2022-02-15 00:37:22,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:37:22,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:37:22,955 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/diskperf_simpl1.cil.c[2072,2085] [2022-02-15 00:37:23,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:37:23,085 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:37:23,105 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/diskperf_simpl1.cil.c[2072,2085] [2022-02-15 00:37:23,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:37:23,164 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:37:23,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23 WrapperNode [2022-02-15 00:37:23,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:37:23,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:37:23,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:37:23,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:37:23,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:37:23,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:37:23,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:37:23,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:37:23,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:23,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:37:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:37:23,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 00:37:23,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 00:37:23,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:37:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:37:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:37:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-15 00:37:23,311 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-15 00:37:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2022-02-15 00:37:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2022-02-15 00:37:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-02-15 00:37:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2022-02-15 00:37:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2022-02-15 00:37:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-02-15 00:37:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2022-02-15 00:37:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-02-15 00:37:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2022-02-15 00:37:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-02-15 00:37:23,314 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2022-02-15 00:37:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-15 00:37:23,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-02-15 00:37:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:37:23,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-02-15 00:37:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-15 00:37:23,318 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:37:23,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:37:23,505 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:37:23,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:37:23,553 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,657 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-02-15 00:37:23,657 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-02-15 00:37:23,662 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,713 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-02-15 00:37:23,713 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-02-15 00:37:23,728 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,746 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-15 00:37:23,746 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-15 00:37:23,752 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,760 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-15 00:37:23,760 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-15 00:37:23,904 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,923 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-02-15 00:37:23,923 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-02-15 00:37:23,941 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:37:23,949 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-02-15 00:37:23,950 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-02-15 00:37:23,971 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:37:23,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:37:23,979 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:37:23,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:37:23 BoogieIcfgContainer [2022-02-15 00:37:23,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:37:23,981 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:37:23,981 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:37:23,982 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:37:23,984 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:37:23" (1/1) ... [2022-02-15 00:37:24,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:37:24 BasicIcfg [2022-02-15 00:37:24,049 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:37:24,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:37:24,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:37:24,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:37:24,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:37:22" (1/4) ... [2022-02-15 00:37:24,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965eaca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:37:24, skipping insertion in model container [2022-02-15 00:37:24,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:37:23" (2/4) ... [2022-02-15 00:37:24,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965eaca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:37:24, skipping insertion in model container [2022-02-15 00:37:24,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:37:23" (3/4) ... [2022-02-15 00:37:24,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965eaca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:37:24, skipping insertion in model container [2022-02-15 00:37:24,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:37:24" (4/4) ... [2022-02-15 00:37:24,065 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.cJordan [2022-02-15 00:37:24,068 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:37:24,069 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:37:24,100 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:37:24,111 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 00:37:24,111 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:37:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2022-02-15 00:37:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 00:37:24,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:24,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:24,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 13220813, now seen corresponding path program 1 times [2022-02-15 00:37:24,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:24,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813313655] [2022-02-15 00:37:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:24,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:24,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813313655] [2022-02-15 00:37:24,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813313655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:24,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:24,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:37:24,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170687448] [2022-02-15 00:37:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:24,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:37:24,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:37:24,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:37:24,524 INFO L87 Difference]: Start difference. First operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-15 00:37:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:25,325 INFO L93 Difference]: Finished difference Result 342 states and 472 transitions. [2022-02-15 00:37:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:37:25,327 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-15 00:37:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:25,335 INFO L225 Difference]: With dead ends: 342 [2022-02-15 00:37:25,335 INFO L226 Difference]: Without dead ends: 326 [2022-02-15 00:37:25,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:37:25,338 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 234 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:25,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 597 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-02-15 00:37:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2022-02-15 00:37:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-02-15 00:37:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2022-02-15 00:37:25,379 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2022-02-15 00:37:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:25,380 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2022-02-15 00:37:25,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-15 00:37:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2022-02-15 00:37:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 00:37:25,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:25,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:25,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:37:25,381 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 690648180, now seen corresponding path program 1 times [2022-02-15 00:37:25,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:25,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975513621] [2022-02-15 00:37:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:25,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:25,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975513621] [2022-02-15 00:37:25,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975513621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:25,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:25,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:37:25,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609633608] [2022-02-15 00:37:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:25,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:37:25,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:37:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:37:25,546 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:26,783 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2022-02-15 00:37:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:37:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-15 00:37:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:26,786 INFO L225 Difference]: With dead ends: 508 [2022-02-15 00:37:26,787 INFO L226 Difference]: Without dead ends: 507 [2022-02-15 00:37:26,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:26,788 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 428 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:26,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 716 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-15 00:37:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-02-15 00:37:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2022-02-15 00:37:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2022-02-15 00:37:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2022-02-15 00:37:26,830 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2022-02-15 00:37:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:26,830 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2022-02-15 00:37:26,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2022-02-15 00:37:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 00:37:26,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:26,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:26,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:37:26,834 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 543429165, now seen corresponding path program 1 times [2022-02-15 00:37:26,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:26,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438712414] [2022-02-15 00:37:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:27,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:27,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438712414] [2022-02-15 00:37:27,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438712414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:27,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:27,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:37:27,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042197996] [2022-02-15 00:37:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:27,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:37:27,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:37:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:37:27,006 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:27,821 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2022-02-15 00:37:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:37:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-15 00:37:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:27,825 INFO L225 Difference]: With dead ends: 690 [2022-02-15 00:37:27,825 INFO L226 Difference]: Without dead ends: 690 [2022-02-15 00:37:27,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:27,826 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 501 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:27,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 610 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-02-15 00:37:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2022-02-15 00:37:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-02-15 00:37:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2022-02-15 00:37:27,858 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2022-02-15 00:37:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:27,858 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2022-02-15 00:37:27,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2022-02-15 00:37:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-15 00:37:27,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:27,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:27,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:37:27,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1394943520, now seen corresponding path program 1 times [2022-02-15 00:37:27,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:27,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104991132] [2022-02-15 00:37:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:27,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:27,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104991132] [2022-02-15 00:37:27,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104991132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:27,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:27,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:37:27,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773330624] [2022-02-15 00:37:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:27,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:37:27,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:37:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:37:27,997 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:28,574 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2022-02-15 00:37:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:37:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 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 36 [2022-02-15 00:37:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:28,578 INFO L225 Difference]: With dead ends: 661 [2022-02-15 00:37:28,578 INFO L226 Difference]: Without dead ends: 661 [2022-02-15 00:37:28,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:37:28,579 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 224 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:28,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 589 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-02-15 00:37:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-02-15 00:37:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-02-15 00:37:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2022-02-15 00:37:28,609 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2022-02-15 00:37:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:28,609 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2022-02-15 00:37:28,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2022-02-15 00:37:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-15 00:37:28,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:28,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:28,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:37:28,615 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -455202915, now seen corresponding path program 1 times [2022-02-15 00:37:28,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:28,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155244648] [2022-02-15 00:37:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:37:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:28,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:28,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155244648] [2022-02-15 00:37:28,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155244648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:28,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:28,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:37:28,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110356910] [2022-02-15 00:37:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:28,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:37:28,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:37:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:28,740 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:29,134 INFO L93 Difference]: Finished difference Result 705 states and 1001 transitions. [2022-02-15 00:37:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 00:37:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 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 39 [2022-02-15 00:37:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:29,137 INFO L225 Difference]: With dead ends: 705 [2022-02-15 00:37:29,137 INFO L226 Difference]: Without dead ends: 705 [2022-02-15 00:37:29,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:37:29,138 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 415 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:29,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 621 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-15 00:37:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-15 00:37:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.3504098360655739) internal successors, (659), 502 states have internal predecessors, (659), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-15 00:37:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 937 transitions. [2022-02-15 00:37:29,153 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 937 transitions. Word has length 39 [2022-02-15 00:37:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:29,153 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 937 transitions. [2022-02-15 00:37:29,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 937 transitions. [2022-02-15 00:37:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-15 00:37:29,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:29,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:29,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:37:29,154 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:29,154 INFO L85 PathProgramCache]: Analyzing trace with hash -454217859, now seen corresponding path program 1 times [2022-02-15 00:37:29,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:29,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466771106] [2022-02-15 00:37:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:29,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:37:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:29,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:29,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466771106] [2022-02-15 00:37:29,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466771106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:29,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:29,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:29,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859600427] [2022-02-15 00:37:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:29,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:29,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:29,346 INFO L87 Difference]: Start difference. First operand 658 states and 937 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:30,383 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2022-02-15 00:37:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 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 39 [2022-02-15 00:37:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:30,386 INFO L225 Difference]: With dead ends: 705 [2022-02-15 00:37:30,386 INFO L226 Difference]: Without dead ends: 705 [2022-02-15 00:37:30,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-15 00:37:30,387 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 559 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:30,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 760 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:37:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-15 00:37:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-15 00:37:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-15 00:37:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2022-02-15 00:37:30,404 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2022-02-15 00:37:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:30,404 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2022-02-15 00:37:30,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2022-02-15 00:37:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-15 00:37:30,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:30,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:30,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:37:30,406 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1225775968, now seen corresponding path program 1 times [2022-02-15 00:37:30,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:30,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095924167] [2022-02-15 00:37:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:37:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:30,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:30,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095924167] [2022-02-15 00:37:30,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095924167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:30,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:30,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:30,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228345457] [2022-02-15 00:37:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:30,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:30,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:30,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:30,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:30,593 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:31,564 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2022-02-15 00:37:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-15 00:37:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:31,567 INFO L225 Difference]: With dead ends: 705 [2022-02-15 00:37:31,567 INFO L226 Difference]: Without dead ends: 705 [2022-02-15 00:37:31,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-15 00:37:31,568 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 1133 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:31,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 865 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:37:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-02-15 00:37:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-02-15 00:37:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-02-15 00:37:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2022-02-15 00:37:31,582 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2022-02-15 00:37:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:31,582 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2022-02-15 00:37:31,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2022-02-15 00:37:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-15 00:37:31,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:31,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:31,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:37:31,585 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:31,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash 636808681, now seen corresponding path program 1 times [2022-02-15 00:37:31,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:31,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991491453] [2022-02-15 00:37:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:37:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:31,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:31,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991491453] [2022-02-15 00:37:31,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991491453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:31,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:31,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:37:31,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133250215] [2022-02-15 00:37:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:31,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:37:31,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:37:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:31,731 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:32,259 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2022-02-15 00:37:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:37:32,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-02-15 00:37:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:32,264 INFO L225 Difference]: With dead ends: 1186 [2022-02-15 00:37:32,264 INFO L226 Difference]: Without dead ends: 1186 [2022-02-15 00:37:32,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:37:32,265 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 749 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:32,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 719 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-02-15 00:37:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2022-02-15 00:37:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2022-02-15 00:37:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2022-02-15 00:37:32,289 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2022-02-15 00:37:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:32,289 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2022-02-15 00:37:32,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2022-02-15 00:37:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 00:37:32,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:32,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:32,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:37:32,290 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1732782333, now seen corresponding path program 1 times [2022-02-15 00:37:32,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:32,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688398206] [2022-02-15 00:37:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-15 00:37:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:32,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:32,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688398206] [2022-02-15 00:37:32,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688398206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:32,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:32,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:37:32,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327104192] [2022-02-15 00:37:32,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:32,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:37:32,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:37:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:37:32,406 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:33,336 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2022-02-15 00:37:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:37:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-02-15 00:37:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:33,341 INFO L225 Difference]: With dead ends: 1167 [2022-02-15 00:37:33,341 INFO L226 Difference]: Without dead ends: 1148 [2022-02-15 00:37:33,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:37:33,342 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 133 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:33,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 1134 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:37:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-02-15 00:37:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2022-02-15 00:37:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2022-02-15 00:37:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2022-02-15 00:37:33,371 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2022-02-15 00:37:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:33,371 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2022-02-15 00:37:33,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2022-02-15 00:37:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 00:37:33,372 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:33,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:33,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:37:33,372 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1415168827, now seen corresponding path program 1 times [2022-02-15 00:37:33,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:33,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387864563] [2022-02-15 00:37:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:33,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:33,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:33,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387864563] [2022-02-15 00:37:33,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387864563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:33,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:33,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:37:33,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325399400] [2022-02-15 00:37:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:33,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:37:33,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:37:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:37:33,479 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:33,830 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2022-02-15 00:37:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:37:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-02-15 00:37:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:33,833 INFO L225 Difference]: With dead ends: 599 [2022-02-15 00:37:33,833 INFO L226 Difference]: Without dead ends: 599 [2022-02-15 00:37:33,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:33,834 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 446 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:33,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 311 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:37:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-15 00:37:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2022-02-15 00:37:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2022-02-15 00:37:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2022-02-15 00:37:33,846 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2022-02-15 00:37:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:33,846 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2022-02-15 00:37:33,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:37:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2022-02-15 00:37:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 00:37:33,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:33,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:33,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:37:33,848 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236117, now seen corresponding path program 1 times [2022-02-15 00:37:33,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:33,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873951865] [2022-02-15 00:37:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:33,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:33,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873951865] [2022-02-15 00:37:33,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873951865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:33,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:33,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:37:33,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763445996] [2022-02-15 00:37:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:33,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:37:33,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:37:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:37:33,988 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:34,795 INFO L93 Difference]: Finished difference Result 630 states and 890 transitions. [2022-02-15 00:37:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:37:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 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 46 [2022-02-15 00:37:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:34,797 INFO L225 Difference]: With dead ends: 630 [2022-02-15 00:37:34,797 INFO L226 Difference]: Without dead ends: 608 [2022-02-15 00:37:34,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:34,804 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 112 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:34,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1208 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-02-15 00:37:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-02-15 00:37:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2022-02-15 00:37:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2022-02-15 00:37:34,815 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2022-02-15 00:37:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:34,815 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2022-02-15 00:37:34,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2022-02-15 00:37:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 00:37:34,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:34,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:34,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:37:34,816 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -961233056, now seen corresponding path program 1 times [2022-02-15 00:37:34,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:34,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234453325] [2022-02-15 00:37:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:34,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:34,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234453325] [2022-02-15 00:37:34,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234453325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:34,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:34,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:37:34,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125572781] [2022-02-15 00:37:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:34,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:37:34,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:37:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:34,954 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:35,459 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2022-02-15 00:37:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:37:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-02-15 00:37:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:35,463 INFO L225 Difference]: With dead ends: 826 [2022-02-15 00:37:35,463 INFO L226 Difference]: Without dead ends: 826 [2022-02-15 00:37:35,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:37:35,464 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 520 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:35,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 636 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-02-15 00:37:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-02-15 00:37:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2022-02-15 00:37:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2022-02-15 00:37:35,481 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2022-02-15 00:37:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:35,482 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2022-02-15 00:37:35,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2022-02-15 00:37:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 00:37:35,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:35,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:35,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:37:35,483 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash -91170375, now seen corresponding path program 1 times [2022-02-15 00:37:35,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:35,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667415961] [2022-02-15 00:37:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:35,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:35,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667415961] [2022-02-15 00:37:35,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667415961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:35,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:35,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:37:35,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467574113] [2022-02-15 00:37:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:35,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:37:35,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:37:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:35,585 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-15 00:37:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:36,243 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2022-02-15 00:37:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:37:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-02-15 00:37:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:36,245 INFO L225 Difference]: With dead ends: 462 [2022-02-15 00:37:36,245 INFO L226 Difference]: Without dead ends: 462 [2022-02-15 00:37:36,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:36,246 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 471 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:36,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 677 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-02-15 00:37:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2022-02-15 00:37:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2022-02-15 00:37:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2022-02-15 00:37:36,255 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2022-02-15 00:37:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:36,256 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2022-02-15 00:37:36,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-15 00:37:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2022-02-15 00:37:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 00:37:36,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:36,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:36,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:37:36,257 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash 298099852, now seen corresponding path program 1 times [2022-02-15 00:37:36,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:36,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278100120] [2022-02-15 00:37:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:36,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:36,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278100120] [2022-02-15 00:37:36,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278100120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:36,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:36,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:37:36,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309221800] [2022-02-15 00:37:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:36,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:37:36,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:37:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:36,421 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:37,134 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2022-02-15 00:37:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:37,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2022-02-15 00:37:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:37,136 INFO L225 Difference]: With dead ends: 454 [2022-02-15 00:37:37,136 INFO L226 Difference]: Without dead ends: 453 [2022-02-15 00:37:37,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:37,137 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 235 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:37,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1488 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-15 00:37:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2022-02-15 00:37:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2022-02-15 00:37:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2022-02-15 00:37:37,144 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2022-02-15 00:37:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:37,144 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2022-02-15 00:37:37,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2022-02-15 00:37:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 00:37:37,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:37,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:37,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:37:37,145 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 298068108, now seen corresponding path program 1 times [2022-02-15 00:37:37,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:37,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986322849] [2022-02-15 00:37:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:37,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:37,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986322849] [2022-02-15 00:37:37,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986322849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:37,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:37,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:37:37,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440619420] [2022-02-15 00:37:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:37,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:37:37,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:37:37,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:37,305 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:37,875 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2022-02-15 00:37:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:37:37,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2022-02-15 00:37:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:37,877 INFO L225 Difference]: With dead ends: 487 [2022-02-15 00:37:37,877 INFO L226 Difference]: Without dead ends: 472 [2022-02-15 00:37:37,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:37:37,877 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 338 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:37,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 1475 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-15 00:37:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2022-02-15 00:37:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2022-02-15 00:37:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2022-02-15 00:37:37,885 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2022-02-15 00:37:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:37,885 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2022-02-15 00:37:37,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2022-02-15 00:37:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-15 00:37:37,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:37,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:37,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:37:37,886 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash -309998534, now seen corresponding path program 1 times [2022-02-15 00:37:37,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:37,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030067546] [2022-02-15 00:37:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:38,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:38,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030067546] [2022-02-15 00:37:38,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030067546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:38,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:38,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:37:38,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141755014] [2022-02-15 00:37:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:38,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:37:38,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:38,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:37:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:37:38,040 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:39,253 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2022-02-15 00:37:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 00:37:39,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 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 48 [2022-02-15 00:37:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:39,255 INFO L225 Difference]: With dead ends: 590 [2022-02-15 00:37:39,255 INFO L226 Difference]: Without dead ends: 575 [2022-02-15 00:37:39,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:37:39,256 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 847 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:39,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 798 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:37:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-02-15 00:37:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2022-02-15 00:37:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2022-02-15 00:37:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2022-02-15 00:37:39,264 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2022-02-15 00:37:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:39,264 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2022-02-15 00:37:39,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2022-02-15 00:37:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 00:37:39,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:39,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:39,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:37:39,265 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 328516868, now seen corresponding path program 1 times [2022-02-15 00:37:39,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:39,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176174280] [2022-02-15 00:37:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-15 00:37:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:39,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:39,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176174280] [2022-02-15 00:37:39,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176174280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:39,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:39,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:39,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026426482] [2022-02-15 00:37:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:39,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:39,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:39,395 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:39,942 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2022-02-15 00:37:39,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:39,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2022-02-15 00:37:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:39,944 INFO L225 Difference]: With dead ends: 455 [2022-02-15 00:37:39,944 INFO L226 Difference]: Without dead ends: 427 [2022-02-15 00:37:39,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:39,944 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 160 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:39,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 1515 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-02-15 00:37:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-02-15 00:37:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2022-02-15 00:37:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2022-02-15 00:37:39,950 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2022-02-15 00:37:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:39,950 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2022-02-15 00:37:39,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2022-02-15 00:37:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 00:37:39,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:39,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:39,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:37:39,951 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1720991068, now seen corresponding path program 1 times [2022-02-15 00:37:39,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:39,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258415149] [2022-02-15 00:37:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 00:37:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-15 00:37:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:40,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:40,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258415149] [2022-02-15 00:37:40,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258415149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:40,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:40,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:37:40,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006048176] [2022-02-15 00:37:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:40,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:37:40,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:37:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:37:40,085 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:40,706 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2022-02-15 00:37:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-02-15 00:37:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:40,709 INFO L225 Difference]: With dead ends: 453 [2022-02-15 00:37:40,709 INFO L226 Difference]: Without dead ends: 423 [2022-02-15 00:37:40,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:40,710 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 115 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:40,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1070 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-02-15 00:37:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2022-02-15 00:37:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2022-02-15 00:37:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2022-02-15 00:37:40,716 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2022-02-15 00:37:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:40,716 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2022-02-15 00:37:40,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2022-02-15 00:37:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 00:37:40,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:40,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:40,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 00:37:40,719 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1090499838, now seen corresponding path program 1 times [2022-02-15 00:37:40,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:40,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504405275] [2022-02-15 00:37:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:40,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:40,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504405275] [2022-02-15 00:37:40,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504405275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:40,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:40,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 00:37:40,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063044855] [2022-02-15 00:37:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:40,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 00:37:40,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 00:37:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:37:40,849 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 00:37:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:42,324 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2022-02-15 00:37:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 00:37:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-02-15 00:37:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:42,326 INFO L225 Difference]: With dead ends: 600 [2022-02-15 00:37:42,326 INFO L226 Difference]: Without dead ends: 600 [2022-02-15 00:37:42,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-02-15 00:37:42,327 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 627 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:42,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1247 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-15 00:37:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-02-15 00:37:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-02-15 00:37:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-15 00:37:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2022-02-15 00:37:42,336 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2022-02-15 00:37:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:42,336 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2022-02-15 00:37:42,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 00:37:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2022-02-15 00:37:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 00:37:42,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:42,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:42,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:37:42,337 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:42,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1506717387, now seen corresponding path program 1 times [2022-02-15 00:37:42,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:42,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142363906] [2022-02-15 00:37:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:42,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:42,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142363906] [2022-02-15 00:37:42,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142363906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:42,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:42,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 00:37:42,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804604961] [2022-02-15 00:37:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:42,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:37:42,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:37:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:37:42,472 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:43,030 INFO L93 Difference]: Finished difference Result 555 states and 796 transitions. [2022-02-15 00:37:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:43,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-02-15 00:37:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:43,032 INFO L225 Difference]: With dead ends: 555 [2022-02-15 00:37:43,032 INFO L226 Difference]: Without dead ends: 555 [2022-02-15 00:37:43,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-02-15 00:37:43,033 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 616 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:43,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 735 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-02-15 00:37:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 537. [2022-02-15 00:37:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 402 states have (on average 1.3432835820895523) internal successors, (540), 413 states have internal predecessors, (540), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-15 00:37:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 773 transitions. [2022-02-15 00:37:43,041 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 773 transitions. Word has length 51 [2022-02-15 00:37:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:43,041 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 773 transitions. [2022-02-15 00:37:43,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 773 transitions. [2022-02-15 00:37:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 00:37:43,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:43,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:43,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 00:37:43,042 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1791177556, now seen corresponding path program 1 times [2022-02-15 00:37:43,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:43,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491142443] [2022-02-15 00:37:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:43,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-02-15 00:37:43,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:43,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491142443] [2022-02-15 00:37:43,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491142443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:43,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:43,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:43,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803718325] [2022-02-15 00:37:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:43,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:43,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:43,185 INFO L87 Difference]: Start difference. First operand 537 states and 773 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 00:37:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:43,960 INFO L93 Difference]: Finished difference Result 624 states and 937 transitions. [2022-02-15 00:37:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:37:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2022-02-15 00:37:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:43,962 INFO L225 Difference]: With dead ends: 624 [2022-02-15 00:37:43,962 INFO L226 Difference]: Without dead ends: 624 [2022-02-15 00:37:43,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-02-15 00:37:43,963 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 491 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:43,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 772 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-02-15 00:37:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 529. [2022-02-15 00:37:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 405 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-15 00:37:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2022-02-15 00:37:43,972 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 51 [2022-02-15 00:37:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:43,972 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2022-02-15 00:37:43,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 00:37:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2022-02-15 00:37:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 00:37:43,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:43,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:43,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:37:43,973 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -50366668, now seen corresponding path program 1 times [2022-02-15 00:37:43,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:43,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160604259] [2022-02-15 00:37:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:44,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:44,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160604259] [2022-02-15 00:37:44,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160604259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:44,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:44,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 00:37:44,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317444395] [2022-02-15 00:37:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:44,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 00:37:44,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 00:37:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:37:44,079 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:44,498 INFO L93 Difference]: Finished difference Result 701 states and 1080 transitions. [2022-02-15 00:37:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 00:37:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 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 51 [2022-02-15 00:37:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:44,501 INFO L225 Difference]: With dead ends: 701 [2022-02-15 00:37:44,501 INFO L226 Difference]: Without dead ends: 701 [2022-02-15 00:37:44,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:37:44,501 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 304 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:44,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 728 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-02-15 00:37:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 524. [2022-02-15 00:37:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-02-15 00:37:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2022-02-15 00:37:44,511 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2022-02-15 00:37:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:44,511 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2022-02-15 00:37:44,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2022-02-15 00:37:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:37:44,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:44,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:44,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:37:44,512 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1529813192, now seen corresponding path program 1 times [2022-02-15 00:37:44,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:44,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900452181] [2022-02-15 00:37:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:44,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:44,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900452181] [2022-02-15 00:37:44,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900452181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:44,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:44,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:44,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282439991] [2022-02-15 00:37:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:44,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:44,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:44,627 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:45,136 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2022-02-15 00:37:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-02-15 00:37:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:45,138 INFO L225 Difference]: With dead ends: 544 [2022-02-15 00:37:45,138 INFO L226 Difference]: Without dead ends: 543 [2022-02-15 00:37:45,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:45,139 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 196 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:45,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 1339 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-02-15 00:37:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-02-15 00:37:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-15 00:37:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2022-02-15 00:37:45,147 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2022-02-15 00:37:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:45,147 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2022-02-15 00:37:45,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2022-02-15 00:37:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:37:45,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:45,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:45,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 00:37:45,148 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1529844936, now seen corresponding path program 1 times [2022-02-15 00:37:45,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:45,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140750382] [2022-02-15 00:37:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:45,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:45,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140750382] [2022-02-15 00:37:45,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140750382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:45,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:45,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:45,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196550150] [2022-02-15 00:37:45,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:45,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:45,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:45,321 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:45,962 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2022-02-15 00:37:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 00:37:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-02-15 00:37:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:45,964 INFO L225 Difference]: With dead ends: 559 [2022-02-15 00:37:45,964 INFO L226 Difference]: Without dead ends: 538 [2022-02-15 00:37:45,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:45,965 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 138 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:45,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1449 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-02-15 00:37:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2022-02-15 00:37:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-15 00:37:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2022-02-15 00:37:45,976 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2022-02-15 00:37:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:45,976 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2022-02-15 00:37:45,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:37:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2022-02-15 00:37:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 00:37:45,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:45,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:45,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 00:37:45,977 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1874017512, now seen corresponding path program 1 times [2022-02-15 00:37:45,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:45,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904688212] [2022-02-15 00:37:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-15 00:37:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 00:37:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:46,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:46,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904688212] [2022-02-15 00:37:46,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904688212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:46,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:46,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:37:46,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080414049] [2022-02-15 00:37:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:46,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:37:46,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:37:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:37:46,089 INFO L87 Difference]: Start difference. First operand 530 states and 758 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:46,606 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2022-02-15 00:37:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:46,606 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-02-15 00:37:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:46,621 INFO L225 Difference]: With dead ends: 549 [2022-02-15 00:37:46,621 INFO L226 Difference]: Without dead ends: 549 [2022-02-15 00:37:46,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:46,622 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 188 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:46,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 723 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-02-15 00:37:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2022-02-15 00:37:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-02-15 00:37:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2022-02-15 00:37:46,634 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2022-02-15 00:37:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:46,634 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2022-02-15 00:37:46,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2022-02-15 00:37:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 00:37:46,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:46,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:46,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 00:37:46,635 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:46,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2132872221, now seen corresponding path program 1 times [2022-02-15 00:37:46,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:46,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252480799] [2022-02-15 00:37:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-15 00:37:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:46,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252480799] [2022-02-15 00:37:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252480799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:46,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:46,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 00:37:46,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973086335] [2022-02-15 00:37:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:46,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:37:46,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:37:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:37:46,768 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:47,721 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2022-02-15 00:37:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:37:47,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 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 53 [2022-02-15 00:37:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:47,723 INFO L225 Difference]: With dead ends: 671 [2022-02-15 00:37:47,723 INFO L226 Difference]: Without dead ends: 639 [2022-02-15 00:37:47,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:37:47,724 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 561 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:47,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 737 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-02-15 00:37:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2022-02-15 00:37:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2022-02-15 00:37:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2022-02-15 00:37:47,742 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2022-02-15 00:37:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:47,743 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2022-02-15 00:37:47,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 00:37:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2022-02-15 00:37:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-15 00:37:47,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:47,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:47,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 00:37:47,743 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 983025775, now seen corresponding path program 1 times [2022-02-15 00:37:47,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:47,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857931718] [2022-02-15 00:37:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:47,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:47,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857931718] [2022-02-15 00:37:47,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857931718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:47,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:47,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:37:47,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310831964] [2022-02-15 00:37:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:47,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:37:47,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:47,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:37:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:47,944 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:48,471 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2022-02-15 00:37:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:37:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-02-15 00:37:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:48,473 INFO L225 Difference]: With dead ends: 390 [2022-02-15 00:37:48,473 INFO L226 Difference]: Without dead ends: 390 [2022-02-15 00:37:48,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:48,473 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 153 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:48,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1520 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-15 00:37:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2022-02-15 00:37:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2022-02-15 00:37:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-02-15 00:37:48,479 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-02-15 00:37:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:48,480 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-02-15 00:37:48,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-02-15 00:37:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 00:37:48,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:48,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:48,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 00:37:48,480 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1006609107, now seen corresponding path program 1 times [2022-02-15 00:37:48,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:48,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877021171] [2022-02-15 00:37:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:48,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-02-15 00:37:48,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:48,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877021171] [2022-02-15 00:37:48,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877021171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:48,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:48,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:37:48,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541955634] [2022-02-15 00:37:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:48,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:37:48,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:48,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:37:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:37:48,654 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:49,301 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2022-02-15 00:37:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:37:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-02-15 00:37:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:49,302 INFO L225 Difference]: With dead ends: 343 [2022-02-15 00:37:49,302 INFO L226 Difference]: Without dead ends: 304 [2022-02-15 00:37:49,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:37:49,303 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 155 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:49,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1485 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-15 00:37:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2022-02-15 00:37:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-02-15 00:37:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2022-02-15 00:37:49,308 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2022-02-15 00:37:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:49,308 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2022-02-15 00:37:49,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 00:37:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2022-02-15 00:37:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-15 00:37:49,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:49,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:49,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 00:37:49,309 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash -763479135, now seen corresponding path program 1 times [2022-02-15 00:37:49,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:49,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285333646] [2022-02-15 00:37:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:49,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:49,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285333646] [2022-02-15 00:37:49,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285333646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:49,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:49,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:49,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431847759] [2022-02-15 00:37:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:49,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:49,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:49,456 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:37:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:50,022 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2022-02-15 00:37:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 00:37:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-15 00:37:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:50,024 INFO L225 Difference]: With dead ends: 316 [2022-02-15 00:37:50,024 INFO L226 Difference]: Without dead ends: 316 [2022-02-15 00:37:50,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-02-15 00:37:50,024 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 246 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:50,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 867 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:37:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-15 00:37:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-02-15 00:37:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-02-15 00:37:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2022-02-15 00:37:50,031 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 66 [2022-02-15 00:37:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:50,031 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2022-02-15 00:37:50,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:37:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2022-02-15 00:37:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-15 00:37:50,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:50,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:50,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 00:37:50,032 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1216763617, now seen corresponding path program 1 times [2022-02-15 00:37:50,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:50,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467048147] [2022-02-15 00:37:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:50,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:50,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467048147] [2022-02-15 00:37:50,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467048147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:50,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:50,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:50,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823826417] [2022-02-15 00:37:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:50,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:50,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:50,193 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 00:37:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:50,555 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2022-02-15 00:37:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2022-02-15 00:37:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:50,556 INFO L225 Difference]: With dead ends: 330 [2022-02-15 00:37:50,556 INFO L226 Difference]: Without dead ends: 330 [2022-02-15 00:37:50,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:50,557 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 133 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:50,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 1195 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:37:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-15 00:37:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2022-02-15 00:37:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-02-15 00:37:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2022-02-15 00:37:50,562 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2022-02-15 00:37:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:50,562 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2022-02-15 00:37:50,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 00:37:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2022-02-15 00:37:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-15 00:37:50,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:50,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:50,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 00:37:50,563 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 107043316, now seen corresponding path program 1 times [2022-02-15 00:37:50,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:50,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330708781] [2022-02-15 00:37:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:50,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:50,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330708781] [2022-02-15 00:37:50,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330708781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:50,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:50,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 00:37:50,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005218378] [2022-02-15 00:37:50,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:50,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:37:50,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:37:50,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:37:50,717 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 00:37:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:51,036 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2022-02-15 00:37:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-02-15 00:37:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:51,038 INFO L225 Difference]: With dead ends: 474 [2022-02-15 00:37:51,038 INFO L226 Difference]: Without dead ends: 474 [2022-02-15 00:37:51,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:51,038 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 230 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:51,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 793 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:37:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-15 00:37:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2022-02-15 00:37:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-02-15 00:37:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2022-02-15 00:37:51,044 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2022-02-15 00:37:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:51,044 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2022-02-15 00:37:51,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 00:37:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2022-02-15 00:37:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-15 00:37:51,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:51,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:51,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 00:37:51,045 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1007458050, now seen corresponding path program 1 times [2022-02-15 00:37:51,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:51,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360346455] [2022-02-15 00:37:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 00:37:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:51,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:51,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360346455] [2022-02-15 00:37:51,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360346455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:51,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:51,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 00:37:51,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011400828] [2022-02-15 00:37:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:51,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:37:51,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:37:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 00:37:51,190 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:37:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:51,920 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2022-02-15 00:37:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-02-15 00:37:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:51,922 INFO L225 Difference]: With dead ends: 529 [2022-02-15 00:37:51,922 INFO L226 Difference]: Without dead ends: 529 [2022-02-15 00:37:51,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:51,923 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 328 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:51,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 761 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 00:37:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-02-15 00:37:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2022-02-15 00:37:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2022-02-15 00:37:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-02-15 00:37:51,930 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 70 [2022-02-15 00:37:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:51,930 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-02-15 00:37:51,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 00:37:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-02-15 00:37:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-15 00:37:51,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:51,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:51,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 00:37:51,931 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2035760571, now seen corresponding path program 1 times [2022-02-15 00:37:51,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:51,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912836895] [2022-02-15 00:37:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 00:37:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:52,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:52,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912836895] [2022-02-15 00:37:52,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912836895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:52,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:52,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 00:37:52,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802284116] [2022-02-15 00:37:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:52,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 00:37:52,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 00:37:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:37:52,110 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 00:37:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:52,414 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2022-02-15 00:37:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:37:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2022-02-15 00:37:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:52,416 INFO L225 Difference]: With dead ends: 493 [2022-02-15 00:37:52,416 INFO L226 Difference]: Without dead ends: 493 [2022-02-15 00:37:52,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:37:52,416 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 208 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:52,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1162 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:37:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-02-15 00:37:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2022-02-15 00:37:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2022-02-15 00:37:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2022-02-15 00:37:52,423 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2022-02-15 00:37:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:52,423 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2022-02-15 00:37:52,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 00:37:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2022-02-15 00:37:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-15 00:37:52,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:52,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:52,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 00:37:52,424 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1777696599, now seen corresponding path program 1 times [2022-02-15 00:37:52,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:52,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52027538] [2022-02-15 00:37:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 00:37:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-15 00:37:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:52,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:52,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52027538] [2022-02-15 00:37:52,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52027538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:52,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:52,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 00:37:52,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195361551] [2022-02-15 00:37:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:52,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 00:37:52,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:52,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 00:37:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:37:52,561 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-15 00:37:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:53,246 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2022-02-15 00:37:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:37:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-02-15 00:37:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:53,260 INFO L225 Difference]: With dead ends: 450 [2022-02-15 00:37:53,260 INFO L226 Difference]: Without dead ends: 450 [2022-02-15 00:37:53,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-02-15 00:37:53,261 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 232 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:53,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 1033 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-02-15 00:37:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2022-02-15 00:37:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2022-02-15 00:37:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2022-02-15 00:37:53,266 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2022-02-15 00:37:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:53,266 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2022-02-15 00:37:53,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-15 00:37:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2022-02-15 00:37:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-15 00:37:53,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:53,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:53,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 00:37:53,267 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1836701912, now seen corresponding path program 1 times [2022-02-15 00:37:53,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:53,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029892712] [2022-02-15 00:37:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-15 00:37:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:53,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:53,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029892712] [2022-02-15 00:37:53,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029892712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:53,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:53,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 00:37:53,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883630459] [2022-02-15 00:37:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:53,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 00:37:53,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 00:37:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-02-15 00:37:53,595 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-15 00:37:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:54,170 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2022-02-15 00:37:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 00:37:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2022-02-15 00:37:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:54,172 INFO L225 Difference]: With dead ends: 483 [2022-02-15 00:37:54,172 INFO L226 Difference]: Without dead ends: 461 [2022-02-15 00:37:54,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-02-15 00:37:54,172 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 211 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:54,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 2662 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:37:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-02-15 00:37:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-02-15 00:37:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2022-02-15 00:37:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2022-02-15 00:37:54,178 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2022-02-15 00:37:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:54,178 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2022-02-15 00:37:54,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-15 00:37:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2022-02-15 00:37:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-15 00:37:54,179 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:54,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:54,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 00:37:54,179 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1857542518, now seen corresponding path program 1 times [2022-02-15 00:37:54,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:54,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441186449] [2022-02-15 00:37:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:37:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:54,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:54,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441186449] [2022-02-15 00:37:54,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441186449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:54,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:54,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 00:37:54,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813067323] [2022-02-15 00:37:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:54,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 00:37:54,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 00:37:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-02-15 00:37:54,460 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-15 00:37:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:55,350 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2022-02-15 00:37:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 00:37:55,351 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-02-15 00:37:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:55,361 INFO L225 Difference]: With dead ends: 481 [2022-02-15 00:37:55,361 INFO L226 Difference]: Without dead ends: 459 [2022-02-15 00:37:55,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-02-15 00:37:55,362 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 131 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:55,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 3057 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:37:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-02-15 00:37:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2022-02-15 00:37:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2022-02-15 00:37:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2022-02-15 00:37:55,373 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2022-02-15 00:37:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:55,375 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2022-02-15 00:37:55,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-02-15 00:37:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2022-02-15 00:37:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-15 00:37:55,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:55,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:55,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 00:37:55,376 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1054192149, now seen corresponding path program 1 times [2022-02-15 00:37:55,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:55,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543486156] [2022-02-15 00:37:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-15 00:37:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-15 00:37:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:55,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:55,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543486156] [2022-02-15 00:37:55,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543486156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:55,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:55,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 00:37:55,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858633846] [2022-02-15 00:37:55,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:55,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 00:37:55,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 00:37:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-02-15 00:37:55,726 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-15 00:37:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:56,950 INFO L93 Difference]: Finished difference Result 467 states and 639 transitions. [2022-02-15 00:37:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-15 00:37:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-02-15 00:37:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:56,952 INFO L225 Difference]: With dead ends: 467 [2022-02-15 00:37:56,952 INFO L226 Difference]: Without dead ends: 434 [2022-02-15 00:37:56,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-02-15 00:37:56,953 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 405 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:56,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 825 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-15 00:37:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-15 00:37:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 424. [2022-02-15 00:37:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2022-02-15 00:37:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2022-02-15 00:37:56,965 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2022-02-15 00:37:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:56,965 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2022-02-15 00:37:56,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-15 00:37:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2022-02-15 00:37:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-15 00:37:56,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:56,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:56,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 00:37:56,966 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1385513232, now seen corresponding path program 1 times [2022-02-15 00:37:56,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:56,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461081215] [2022-02-15 00:37:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-15 00:37:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-15 00:37:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-15 00:37:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:57,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:57,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461081215] [2022-02-15 00:37:57,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461081215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:57,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:57,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 00:37:57,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951988466] [2022-02-15 00:37:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:57,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 00:37:57,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 00:37:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-02-15 00:37:57,407 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:37:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:58,159 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2022-02-15 00:37:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 00:37:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 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 108 [2022-02-15 00:37:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:58,161 INFO L225 Difference]: With dead ends: 478 [2022-02-15 00:37:58,161 INFO L226 Difference]: Without dead ends: 454 [2022-02-15 00:37:58,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 00:37:58,161 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 137 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:58,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 2252 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 00:37:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-02-15 00:37:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-02-15 00:37:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2022-02-15 00:37:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2022-02-15 00:37:58,167 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2022-02-15 00:37:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:58,167 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2022-02-15 00:37:58,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:37:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2022-02-15 00:37:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-15 00:37:58,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:58,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:58,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 00:37:58,168 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -205451642, now seen corresponding path program 1 times [2022-02-15 00:37:58,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:58,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086556417] [2022-02-15 00:37:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:37:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:37:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:37:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 00:37:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-02-15 00:37:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:37:58,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:58,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086556417] [2022-02-15 00:37:58,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086556417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:58,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:58,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 00:37:58,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071943876] [2022-02-15 00:37:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:58,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 00:37:58,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 00:37:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-02-15 00:37:58,582 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:37:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:37:59,502 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2022-02-15 00:37:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 00:37:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 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 109 [2022-02-15 00:37:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:37:59,504 INFO L225 Difference]: With dead ends: 480 [2022-02-15 00:37:59,504 INFO L226 Difference]: Without dead ends: 443 [2022-02-15 00:37:59,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 00:37:59,505 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 120 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 2183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:37:59,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 2628 Invalid, 2183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 00:37:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-15 00:37:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2022-02-15 00:37:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-15 00:37:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2022-02-15 00:37:59,511 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2022-02-15 00:37:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:37:59,512 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2022-02-15 00:37:59,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:37:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2022-02-15 00:37:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 00:37:59,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:37:59,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:37:59,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 00:37:59,513 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:37:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:37:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -790809002, now seen corresponding path program 1 times [2022-02-15 00:37:59,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:37:59,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107754715] [2022-02-15 00:37:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:37:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:37:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:37:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:37:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:37:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:37:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:37:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:37:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:37:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:37:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:37:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:37:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:37:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:37:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-15 00:37:59,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:37:59,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107754715] [2022-02-15 00:37:59,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107754715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:37:59,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:37:59,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:37:59,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23430877] [2022-02-15 00:37:59,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:37:59,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:37:59,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:37:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:37:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:37:59,712 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-15 00:38:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:00,249 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2022-02-15 00:38:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:00,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2022-02-15 00:38:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:00,251 INFO L225 Difference]: With dead ends: 420 [2022-02-15 00:38:00,251 INFO L226 Difference]: Without dead ends: 420 [2022-02-15 00:38:00,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:00,251 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 156 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:00,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 1253 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 00:38:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-02-15 00:38:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-02-15 00:38:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2022-02-15 00:38:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2022-02-15 00:38:00,272 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2022-02-15 00:38:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:00,273 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2022-02-15 00:38:00,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-15 00:38:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2022-02-15 00:38:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-15 00:38:00,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:00,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:38:00,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 00:38:00,274 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -474317813, now seen corresponding path program 1 times [2022-02-15 00:38:00,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:00,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388363514] [2022-02-15 00:38:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-15 00:38:00,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:00,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388363514] [2022-02-15 00:38:00,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388363514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:00,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:00,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:38:00,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69301315] [2022-02-15 00:38:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:00,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:38:00,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:00,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:38:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:00,471 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-15 00:38:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:00,968 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2022-02-15 00:38:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:00,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2022-02-15 00:38:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:00,971 INFO L225 Difference]: With dead ends: 547 [2022-02-15 00:38:00,971 INFO L226 Difference]: Without dead ends: 547 [2022-02-15 00:38:00,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:00,971 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 196 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:00,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1507 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:38:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-15 00:38:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2022-02-15 00:38:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-15 00:38:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2022-02-15 00:38:00,982 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2022-02-15 00:38:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:00,982 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2022-02-15 00:38:00,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-02-15 00:38:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2022-02-15 00:38:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-15 00:38:00,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:00,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:38:00,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 00:38:00,983 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash -286096315, now seen corresponding path program 1 times [2022-02-15 00:38:00,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:00,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094487539] [2022-02-15 00:38:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-15 00:38:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 00:38:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-15 00:38:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-15 00:38:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-15 00:38:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:38:01,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:01,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094487539] [2022-02-15 00:38:01,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094487539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:01,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:01,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 00:38:01,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193585879] [2022-02-15 00:38:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:01,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 00:38:01,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:01,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 00:38:01,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-02-15 00:38:01,382 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-02-15 00:38:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:02,634 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2022-02-15 00:38:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 00:38:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2022-02-15 00:38:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:02,635 INFO L225 Difference]: With dead ends: 413 [2022-02-15 00:38:02,635 INFO L226 Difference]: Without dead ends: 354 [2022-02-15 00:38:02,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 00:38:02,636 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 398 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:02,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 492 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 00:38:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-02-15 00:38:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2022-02-15 00:38:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-02-15 00:38:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2022-02-15 00:38:02,641 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2022-02-15 00:38:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:02,641 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2022-02-15 00:38:02,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-02-15 00:38:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2022-02-15 00:38:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-15 00:38:02,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:02,643 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-15 00:38:02,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 00:38:02,643 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 762913287, now seen corresponding path program 1 times [2022-02-15 00:38:02,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:02,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388072446] [2022-02-15 00:38:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:38:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-15 00:38:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-15 00:38:02,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:02,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388072446] [2022-02-15 00:38:02,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388072446] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:38:02,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466985844] [2022-02-15 00:38:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:02,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:38:02,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:38:02,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:38:02,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-15 00:38:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-15 00:38:03,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:38:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-02-15 00:38:03,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-15 00:38:03,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466985844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:03,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-15 00:38:03,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-02-15 00:38:03,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017031040] [2022-02-15 00:38:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:03,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 00:38:03,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 00:38:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:03,300 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:38:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:03,303 INFO L93 Difference]: Finished difference Result 341 states and 434 transitions. [2022-02-15 00:38:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 00:38:03,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-02-15 00:38:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:03,304 INFO L225 Difference]: With dead ends: 341 [2022-02-15 00:38:03,304 INFO L226 Difference]: Without dead ends: 341 [2022-02-15 00:38:03,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:03,305 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 28 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:03,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:38:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-15 00:38:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-02-15 00:38:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.172) internal successors, (293), 255 states have internal predecessors, (293), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-02-15 00:38:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 434 transitions. [2022-02-15 00:38:03,309 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 434 transitions. Word has length 163 [2022-02-15 00:38:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:03,310 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 434 transitions. [2022-02-15 00:38:03,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-15 00:38:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 434 transitions. [2022-02-15 00:38:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-15 00:38:03,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:03,311 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-15 00:38:03,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-15 00:38:03,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-02-15 00:38:03,523 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1424868086, now seen corresponding path program 1 times [2022-02-15 00:38:03,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:03,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362959875] [2022-02-15 00:38:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-15 00:38:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-15 00:38:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-15 00:38:03,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:03,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362959875] [2022-02-15 00:38:03,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362959875] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:38:03,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6837049] [2022-02-15 00:38:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:03,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:38:03,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:38:03,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:38:03,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-15 00:38:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:03,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-15 00:38:03,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:38:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-15 00:38:04,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-15 00:38:04,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6837049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:04,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-15 00:38:04,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2022-02-15 00:38:04,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820898886] [2022-02-15 00:38:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:04,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:38:04,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:38:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:04,100 INFO L87 Difference]: Start difference. First operand 341 states and 434 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-02-15 00:38:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:04,131 INFO L93 Difference]: Finished difference Result 374 states and 481 transitions. [2022-02-15 00:38:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:38:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2022-02-15 00:38:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:04,132 INFO L225 Difference]: With dead ends: 374 [2022-02-15 00:38:04,132 INFO L226 Difference]: Without dead ends: 372 [2022-02-15 00:38:04,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-15 00:38:04,133 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 12 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:04,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 826 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:38:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-02-15 00:38:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2022-02-15 00:38:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1604477611940298) internal successors, (311), 273 states have internal predecessors, (311), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2022-02-15 00:38:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 463 transitions. [2022-02-15 00:38:04,138 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 463 transitions. Word has length 163 [2022-02-15 00:38:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:04,138 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 463 transitions. [2022-02-15 00:38:04,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-02-15 00:38:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 463 transitions. [2022-02-15 00:38:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-15 00:38:04,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:04,139 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-15 00:38:04,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-15 00:38:04,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-02-15 00:38:04,357 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:04,358 INFO L85 PathProgramCache]: Analyzing trace with hash -589316084, now seen corresponding path program 1 times [2022-02-15 00:38:04,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:04,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549250771] [2022-02-15 00:38:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-15 00:38:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-15 00:38:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-15 00:38:04,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:04,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549250771] [2022-02-15 00:38:04,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549250771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:04,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:04,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:38:04,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240915544] [2022-02-15 00:38:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:04,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:38:04,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:38:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:04,563 INFO L87 Difference]: Start difference. First operand 361 states and 463 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-02-15 00:38:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:04,992 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2022-02-15 00:38:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:04,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2022-02-15 00:38:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:04,993 INFO L225 Difference]: With dead ends: 428 [2022-02-15 00:38:04,993 INFO L226 Difference]: Without dead ends: 428 [2022-02-15 00:38:04,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:04,995 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 150 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:04,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1135 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 00:38:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-15 00:38:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2022-02-15 00:38:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2022-02-15 00:38:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2022-02-15 00:38:05,005 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 164 [2022-02-15 00:38:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:05,005 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2022-02-15 00:38:05,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-02-15 00:38:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2022-02-15 00:38:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-02-15 00:38:05,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:05,007 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:38:05,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 00:38:05,007 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash -158276280, now seen corresponding path program 1 times [2022-02-15 00:38:05,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:05,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349119801] [2022-02-15 00:38:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-15 00:38:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-15 00:38:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-15 00:38:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-15 00:38:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-02-15 00:38:05,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:05,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349119801] [2022-02-15 00:38:05,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349119801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:05,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:05,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:38:05,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299701937] [2022-02-15 00:38:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:05,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:38:05,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:38:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:05,231 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-15 00:38:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:05,605 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2022-02-15 00:38:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2022-02-15 00:38:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:05,607 INFO L225 Difference]: With dead ends: 354 [2022-02-15 00:38:05,607 INFO L226 Difference]: Without dead ends: 354 [2022-02-15 00:38:05,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:05,607 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:05,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 915 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:38:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-02-15 00:38:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2022-02-15 00:38:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2022-02-15 00:38:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2022-02-15 00:38:05,615 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2022-02-15 00:38:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:05,615 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2022-02-15 00:38:05,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-15 00:38:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2022-02-15 00:38:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-02-15 00:38:05,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:38:05,617 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:38:05,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 00:38:05,617 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:38:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:38:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1341132510, now seen corresponding path program 1 times [2022-02-15 00:38:05,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:38:05,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868661262] [2022-02-15 00:38:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:38:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:38:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:38:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:38:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 00:38:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-15 00:38:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 00:38:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-15 00:38:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 00:38:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-15 00:38:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-15 00:38:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-15 00:38:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-15 00:38:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-15 00:38:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-15 00:38:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 00:38:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 00:38:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:38:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-02-15 00:38:05,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:38:05,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868661262] [2022-02-15 00:38:05,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868661262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:38:05,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:38:05,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 00:38:05,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891497073] [2022-02-15 00:38:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:38:05,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 00:38:05,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:38:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 00:38:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-15 00:38:05,834 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-15 00:38:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:38:06,148 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2022-02-15 00:38:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 00:38:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2022-02-15 00:38:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:38:06,149 INFO L225 Difference]: With dead ends: 290 [2022-02-15 00:38:06,149 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 00:38:06,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-02-15 00:38:06,150 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 146 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:38:06,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 663 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:38:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 00:38:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 00:38:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 00:38:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 00:38:06,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-02-15 00:38:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:38:06,150 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 00:38:06,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-02-15 00:38:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 00:38:06,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 00:38:06,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:38:06,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 00:38:06,155 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:38:06,156 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:38:06,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:38:06 BasicIcfg [2022-02-15 00:38:06,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:38:06,157 INFO L158 Benchmark]: Toolchain (without parser) took 43428.08ms. Allocated memory was 188.7MB in the beginning and 525.3MB in the end (delta: 336.6MB). Free memory was 135.9MB in the beginning and 240.2MB in the end (delta: -104.3MB). Peak memory consumption was 233.2MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,157 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:38:06,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.78ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 135.8MB in the beginning and 244.4MB in the end (delta: -108.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,158 INFO L158 Benchmark]: Boogie Preprocessor took 89.30ms. Allocated memory is still 280.0MB. Free memory was 244.4MB in the beginning and 240.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,158 INFO L158 Benchmark]: RCFGBuilder took 725.88ms. Allocated memory is still 280.0MB. Free memory was 240.8MB in the beginning and 200.4MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,158 INFO L158 Benchmark]: IcfgTransformer took 78.43ms. Allocated memory is still 280.0MB. Free memory was 200.4MB in the beginning and 195.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,159 INFO L158 Benchmark]: TraceAbstraction took 42096.79ms. Allocated memory was 280.0MB in the beginning and 525.3MB in the end (delta: 245.4MB). Free memory was 195.2MB in the beginning and 240.2MB in the end (delta: -45.1MB). Peak memory consumption was 200.8MB. Max. memory is 8.0GB. [2022-02-15 00:38:06,160 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 188.7MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 433.78ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 135.8MB in the beginning and 244.4MB in the end (delta: -108.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.30ms. Allocated memory is still 280.0MB. Free memory was 244.4MB in the beginning and 240.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 725.88ms. Allocated memory is still 280.0MB. Free memory was 240.8MB in the beginning and 200.4MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * IcfgTransformer took 78.43ms. Allocated memory is still 280.0MB. Free memory was 200.4MB in the beginning and 195.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 42096.79ms. Allocated memory was 280.0MB in the beginning and 525.3MB in the end (delta: 245.4MB). Free memory was 195.2MB in the beginning and 240.2MB in the end (delta: -45.1MB). Peak memory consumption was 200.8MB. 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: 56]: 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 27 procedures, 295 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 47, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14844 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14664 mSDsluCounter, 50853 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37804 mSDsCounter, 6503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48230 IncrementalHoareTripleChecker+Invalid, 54733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6503 mSolverCounterUnsat, 13049 mSDtfsCounter, 48230 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1716 GetRequests, 1005 SyntacticMatches, 9 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=8, InterpolantAutomatonStates: 542, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 47 MinimizatonAttempts, 2092 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3800 NumberOfCodeBlocks, 3800 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3751 ConstructedInterpolants, 0 QuantifiedInterpolants, 14828 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2654 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 49 InterpolantComputations, 47 PerfectInterpolantSequences, 835/847 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-15 00:38:06,181 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...