/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-d966a43 [2022-01-31 16:14:42,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:14:42,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:14:42,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:14:42,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:14:42,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:14:42,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:14:42,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:14:42,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:14:42,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:14:42,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:14:42,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:14:42,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:14:42,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:14:42,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:14:42,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:14:42,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:14:42,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:14:42,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:14:42,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:14:42,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:14:42,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:14:42,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:14:42,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:14:42,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:14:42,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:14:42,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:14:42,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:14:42,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:14:42,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:14:42,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:14:42,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:14:42,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:14:42,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:14:42,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:14:42,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:14:42,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:14:42,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:14:42,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:14:42,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:14:42,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:14:42,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:14:42,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:14:42,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:14:42,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:14:42,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:14:42,241 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:14:42,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:14:42,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:14:42,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:14:42,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:14:42,244 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:14:42,244 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-01-31 16:14:42,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:14:42,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:14:42,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:14:42,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:14:42,525 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:14:42,526 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-01-31 16:14:42,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e07ae1b/b4627fe57244438dada12b62e98264fa/FLAG2e4ca384e [2022-01-31 16:14:42,930 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:14:42,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-01-31 16:14:42,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e07ae1b/b4627fe57244438dada12b62e98264fa/FLAG2e4ca384e [2022-01-31 16:14:43,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e07ae1b/b4627fe57244438dada12b62e98264fa [2022-01-31 16:14:43,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:14:43,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:14:43,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:14:43,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:14:43,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:14:43,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe02c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43, skipping insertion in model container [2022-01-31 16:14:43,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:14:43,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:14:43,510 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-01-31 16:14:43,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:14:43,639 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:14:43,651 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-01-31 16:14:43,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:14:43,721 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:14:43,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43 WrapperNode [2022-01-31 16:14:43,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:14:43,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:14:43,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:14:43,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:14:43,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:14:43,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:14:43,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:14:43,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:14:43,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (1/1) ... [2022-01-31 16:14:43,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:14:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:14:43,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 16:14:43,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 16:14:43,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:14:43,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:14:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:14:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 16:14:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 16:14:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-01-31 16:14:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2022-01-31 16:14:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-01-31 16:14:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2022-01-31 16:14:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-01-31 16:14:43,898 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2022-01-31 16:14:43,899 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2022-01-31 16:14:43,899 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2022-01-31 16:14:43,899 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2022-01-31 16:14:43,899 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 16:14:43,900 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 16:14:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:14:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:14:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:14:43,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-01-31 16:14:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2022-01-31 16:14:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:14:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:14:44,085 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:14:44,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:14:44,147 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,249 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 16:14:44,250 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 16:14:44,256 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,284 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-01-31 16:14:44,285 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-01-31 16:14:44,300 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,312 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 16:14:44,312 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 16:14:44,316 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,323 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:14:44,323 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:14:44,479 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,501 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-31 16:14:44,501 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-31 16:14:44,522 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:44,532 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-01-31 16:14:44,532 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-01-31 16:14:44,555 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:14:44,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:14:44,563 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:14:44,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:44 BoogieIcfgContainer [2022-01-31 16:14:44,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:14:44,566 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:14:44,566 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:14:44,567 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:14:44,569 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:44" (1/1) ... [2022-01-31 16:14:44,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:14:44 BasicIcfg [2022-01-31 16:14:44,606 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:14:44,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:14:44,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:14:44,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:14:44,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:14:43" (1/4) ... [2022-01-31 16:14:44,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c366cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:14:44, skipping insertion in model container [2022-01-31 16:14:44,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:43" (2/4) ... [2022-01-31 16:14:44,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c366cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:14:44, skipping insertion in model container [2022-01-31 16:14:44,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:44" (3/4) ... [2022-01-31 16:14:44,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c366cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:14:44, skipping insertion in model container [2022-01-31 16:14:44,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:14:44" (4/4) ... [2022-01-31 16:14:44,613 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.cJordan [2022-01-31 16:14:44,618 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:14:44,618 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:14:44,651 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:14:44,656 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-01-31 16:14:44,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:14:44,673 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-01-31 16:14:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 16:14:44,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:44,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:44,681 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash 13220813, now seen corresponding path program 1 times [2022-01-31 16:14:44,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114438813] [2022-01-31 16:14:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:44,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:45,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114438813] [2022-01-31 16:14:45,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114438813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:45,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:45,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:14:45,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705811553] [2022-01-31 16:14:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:45,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:14:45,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:14:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:14:45,054 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-01-31 16:14:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:45,947 INFO L93 Difference]: Finished difference Result 342 states and 472 transitions. [2022-01-31 16:14:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:45,950 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-01-31 16:14:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:45,959 INFO L225 Difference]: With dead ends: 342 [2022-01-31 16:14:45,960 INFO L226 Difference]: Without dead ends: 326 [2022-01-31 16:14:45,961 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-01-31 16:14:45,964 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 234 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-01-31 16:14:45,964 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-01-31 16:14:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-01-31 16:14:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2022-01-31 16:14:46,010 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-01-31 16:14:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2022-01-31 16:14:46,013 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2022-01-31 16:14:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:46,013 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2022-01-31 16:14:46,013 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-01-31 16:14:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2022-01-31 16:14:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 16:14:46,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:46,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:46,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:14:46,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 690648180, now seen corresponding path program 1 times [2022-01-31 16:14:46,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033163737] [2022-01-31 16:14:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:46,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:46,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:46,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033163737] [2022-01-31 16:14:46,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033163737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:46,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:46,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:46,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009454516] [2022-01-31 16:14:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:46,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:46,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:46,168 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-01-31 16:14:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:47,768 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2022-01-31 16:14:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 16:14:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:47,773 INFO L225 Difference]: With dead ends: 508 [2022-01-31 16:14:47,773 INFO L226 Difference]: Without dead ends: 507 [2022-01-31 16:14:47,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:47,774 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 428 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:47,775 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.4s Time] [2022-01-31 16:14:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-01-31 16:14:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2022-01-31 16:14:47,819 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-01-31 16:14:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2022-01-31 16:14:47,824 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2022-01-31 16:14:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:47,825 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2022-01-31 16:14:47,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2022-01-31 16:14:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 16:14:47,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:47,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:47,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:14:47,832 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash 543429165, now seen corresponding path program 1 times [2022-01-31 16:14:47,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:47,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814875749] [2022-01-31 16:14:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:47,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:47,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:47,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:47,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814875749] [2022-01-31 16:14:47,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814875749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:47,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:47,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:47,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551617025] [2022-01-31 16:14:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:47,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:47,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:47,993 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-01-31 16:14:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:48,968 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2022-01-31 16:14:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:48,969 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-01-31 16:14:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:48,973 INFO L225 Difference]: With dead ends: 690 [2022-01-31 16:14:48,973 INFO L226 Difference]: Without dead ends: 690 [2022-01-31 16:14:48,974 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-01-31 16:14:48,975 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 501 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:48,975 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.9s Time] [2022-01-31 16:14:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-01-31 16:14:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2022-01-31 16:14:49,002 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-01-31 16:14:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2022-01-31 16:14:49,008 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2022-01-31 16:14:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:49,008 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2022-01-31 16:14:49,008 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-01-31 16:14:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2022-01-31 16:14:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 16:14:49,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:49,010 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-01-31 16:14:49,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:14:49,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1394943520, now seen corresponding path program 1 times [2022-01-31 16:14:49,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:49,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585240602] [2022-01-31 16:14:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:49,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:49,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585240602] [2022-01-31 16:14:49,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585240602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:49,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:49,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:49,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928638937] [2022-01-31 16:14:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:49,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:49,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:49,130 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-01-31 16:14:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:49,809 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2022-01-31 16:14:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:49,809 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-01-31 16:14:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:49,815 INFO L225 Difference]: With dead ends: 661 [2022-01-31 16:14:49,815 INFO L226 Difference]: Without dead ends: 661 [2022-01-31 16:14:49,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:49,827 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 224 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:49,828 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.6s Time] [2022-01-31 16:14:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-01-31 16:14:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-01-31 16:14:49,865 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-01-31 16:14:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2022-01-31 16:14:49,871 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2022-01-31 16:14:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:49,872 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2022-01-31 16:14:49,872 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-01-31 16:14:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2022-01-31 16:14:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 16:14:49,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:49,879 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-01-31 16:14:49,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:14:49,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -455202915, now seen corresponding path program 1 times [2022-01-31 16:14:49,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:49,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988251236] [2022-01-31 16:14:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:49,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:50,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988251236] [2022-01-31 16:14:50,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988251236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:50,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:50,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:50,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728611981] [2022-01-31 16:14:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:50,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:50,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:50,057 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-01-31 16:14:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:50,573 INFO L93 Difference]: Finished difference Result 705 states and 1001 transitions. [2022-01-31 16:14:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:14:50,574 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-01-31 16:14:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:50,577 INFO L225 Difference]: With dead ends: 705 [2022-01-31 16:14:50,577 INFO L226 Difference]: Without dead ends: 705 [2022-01-31 16:14:50,578 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-01-31 16:14:50,578 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 415 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:50,579 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.5s Time] [2022-01-31 16:14:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-31 16:14:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-01-31 16:14:50,597 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-01-31 16:14:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 937 transitions. [2022-01-31 16:14:50,601 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 937 transitions. Word has length 39 [2022-01-31 16:14:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:50,602 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 937 transitions. [2022-01-31 16:14:50,602 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-01-31 16:14:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 937 transitions. [2022-01-31 16:14:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 16:14:50,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:50,603 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-01-31 16:14:50,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:14:50,603 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -454217859, now seen corresponding path program 1 times [2022-01-31 16:14:50,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638625930] [2022-01-31 16:14:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:50,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:50,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638625930] [2022-01-31 16:14:50,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638625930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:50,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:50,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:14:50,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023912975] [2022-01-31 16:14:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:50,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:14:50,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:14:50,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:50,829 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-01-31 16:14:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:52,084 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2022-01-31 16:14:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:14:52,085 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-01-31 16:14:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:52,088 INFO L225 Difference]: With dead ends: 705 [2022-01-31 16:14:52,088 INFO L226 Difference]: Without dead ends: 705 [2022-01-31 16:14:52,089 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-01-31 16:14:52,089 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 559 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:52,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 760 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:14:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-31 16:14:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-01-31 16:14:52,107 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-01-31 16:14:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2022-01-31 16:14:52,111 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2022-01-31 16:14:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:52,111 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2022-01-31 16:14:52,111 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-01-31 16:14:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2022-01-31 16:14:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 16:14:52,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:52,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:52,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:14:52,113 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1225775968, now seen corresponding path program 1 times [2022-01-31 16:14:52,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:52,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53224329] [2022-01-31 16:14:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:52,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:52,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:52,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53224329] [2022-01-31 16:14:52,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53224329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:52,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:52,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:14:52,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860535234] [2022-01-31 16:14:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:52,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:14:52,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:14:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:52,333 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-01-31 16:14:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:53,476 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2022-01-31 16:14:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:14:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-01-31 16:14:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:53,480 INFO L225 Difference]: With dead ends: 705 [2022-01-31 16:14:53,480 INFO L226 Difference]: Without dead ends: 705 [2022-01-31 16:14:53,481 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-01-31 16:14:53,481 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 1133 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:53,482 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.9s Time] [2022-01-31 16:14:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-31 16:14:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-01-31 16:14:53,496 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-01-31 16:14:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2022-01-31 16:14:53,500 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2022-01-31 16:14:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:53,500 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2022-01-31 16:14:53,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:14:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2022-01-31 16:14:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 16:14:53,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:53,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:53,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:14:53,503 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 636808681, now seen corresponding path program 1 times [2022-01-31 16:14:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926695501] [2022-01-31 16:14:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:53,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:53,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926695501] [2022-01-31 16:14:53,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926695501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:53,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:53,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:53,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990034233] [2022-01-31 16:14:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:53,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:53,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:53,642 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-01-31 16:14:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:54,225 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2022-01-31 16:14:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:54,225 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-01-31 16:14:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:54,232 INFO L225 Difference]: With dead ends: 1186 [2022-01-31 16:14:54,233 INFO L226 Difference]: Without dead ends: 1186 [2022-01-31 16:14:54,233 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-01-31 16:14:54,233 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:54,234 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.5s Time] [2022-01-31 16:14:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-01-31 16:14:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2022-01-31 16:14:54,261 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-01-31 16:14:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2022-01-31 16:14:54,266 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2022-01-31 16:14:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:54,268 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2022-01-31 16:14:54,268 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-01-31 16:14:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2022-01-31 16:14:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 16:14:54,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:54,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:54,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:14:54,273 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1732782333, now seen corresponding path program 1 times [2022-01-31 16:14:54,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:54,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312525804] [2022-01-31 16:14:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:54,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:54,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:54,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312525804] [2022-01-31 16:14:54,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312525804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:54,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:54,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:14:54,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585729137] [2022-01-31 16:14:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:54,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:14:54,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:54,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:14:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:54,426 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-01-31 16:14:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:55,480 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2022-01-31 16:14:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-01-31 16:14:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:55,487 INFO L225 Difference]: With dead ends: 1167 [2022-01-31 16:14:55,487 INFO L226 Difference]: Without dead ends: 1148 [2022-01-31 16:14:55,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:55,490 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 133 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:55,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 1134 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:14:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-01-31 16:14:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2022-01-31 16:14:55,517 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-01-31 16:14:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2022-01-31 16:14:55,522 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2022-01-31 16:14:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:55,522 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2022-01-31 16:14:55,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2022-01-31 16:14:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 16:14:55,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:55,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:55,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:14:55,524 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1415168827, now seen corresponding path program 1 times [2022-01-31 16:14:55,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:55,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580108409] [2022-01-31 16:14:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:55,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:55,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580108409] [2022-01-31 16:14:55,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580108409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:55,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:55,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:55,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690791696] [2022-01-31 16:14:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:55,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:55,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:55,649 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-01-31 16:14:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:56,059 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2022-01-31 16:14:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:56,060 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-01-31 16:14:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:56,063 INFO L225 Difference]: With dead ends: 599 [2022-01-31 16:14:56,063 INFO L226 Difference]: Without dead ends: 599 [2022-01-31 16:14:56,063 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-01-31 16:14:56,063 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 446 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-01-31 16:14:56,064 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-01-31 16:14:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-31 16:14:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2022-01-31 16:14:56,076 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-01-31 16:14:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2022-01-31 16:14:56,079 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2022-01-31 16:14:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:56,079 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2022-01-31 16:14:56,079 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-01-31 16:14:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2022-01-31 16:14:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:14:56,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:56,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:56,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:14:56,081 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236117, now seen corresponding path program 1 times [2022-01-31 16:14:56,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122943698] [2022-01-31 16:14:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:56,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:14:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:14:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:56,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122943698] [2022-01-31 16:14:56,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122943698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:56,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:56,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:14:56,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28954360] [2022-01-31 16:14:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:56,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:14:56,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:14:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:14:56,281 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-01-31 16:14:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:57,177 INFO L93 Difference]: Finished difference Result 630 states and 890 transitions. [2022-01-31 16:14:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:14:57,179 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-01-31 16:14:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:57,182 INFO L225 Difference]: With dead ends: 630 [2022-01-31 16:14:57,182 INFO L226 Difference]: Without dead ends: 608 [2022-01-31 16:14:57,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:14:57,183 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 112 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:57,183 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.8s Time] [2022-01-31 16:14:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-01-31 16:14:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-01-31 16:14:57,195 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-01-31 16:14:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2022-01-31 16:14:57,198 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2022-01-31 16:14:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:57,199 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2022-01-31 16:14:57,199 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-01-31 16:14:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2022-01-31 16:14:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:14:57,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:57,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:57,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:14:57,200 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -961233056, now seen corresponding path program 1 times [2022-01-31 16:14:57,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:57,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420056750] [2022-01-31 16:14:57,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:57,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:14:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:14:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:57,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:57,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420056750] [2022-01-31 16:14:57,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420056750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:57,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:57,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:57,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211551935] [2022-01-31 16:14:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:57,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:57,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:57,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:57,369 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-01-31 16:14:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:57,948 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2022-01-31 16:14:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-01-31 16:14:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:57,953 INFO L225 Difference]: With dead ends: 826 [2022-01-31 16:14:57,953 INFO L226 Difference]: Without dead ends: 826 [2022-01-31 16:14:57,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:57,954 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:57,954 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.5s Time] [2022-01-31 16:14:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-01-31 16:14:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-01-31 16:14:57,972 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-01-31 16:14:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2022-01-31 16:14:57,980 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2022-01-31 16:14:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:57,981 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2022-01-31 16:14:57,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2022-01-31 16:14:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 16:14:57,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:57,982 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-01-31 16:14:57,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:14:57,982 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -91170375, now seen corresponding path program 1 times [2022-01-31 16:14:57,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:57,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434794649] [2022-01-31 16:14:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:57,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:14:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:58,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434794649] [2022-01-31 16:14:58,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434794649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:58,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:58,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:58,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922808383] [2022-01-31 16:14:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:58,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:58,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:58,133 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-01-31 16:14:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:58,865 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2022-01-31 16:14:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:14:58,866 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-01-31 16:14:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:58,868 INFO L225 Difference]: With dead ends: 462 [2022-01-31 16:14:58,868 INFO L226 Difference]: Without dead ends: 462 [2022-01-31 16:14:58,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:58,869 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-01-31 16:14:58,869 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-01-31 16:14:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-01-31 16:14:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2022-01-31 16:14:58,876 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-01-31 16:14:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2022-01-31 16:14:58,878 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2022-01-31 16:14:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:58,879 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2022-01-31 16:14:58,879 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-01-31 16:14:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2022-01-31 16:14:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:14:58,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:58,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:58,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:14:58,880 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash 298099852, now seen corresponding path program 1 times [2022-01-31 16:14:58,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907733869] [2022-01-31 16:14:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:58,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:14:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:14:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:14:59,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907733869] [2022-01-31 16:14:59,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907733869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:59,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:59,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:14:59,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413492443] [2022-01-31 16:14:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:59,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:14:59,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:14:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:14:59,078 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-01-31 16:14:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:59,973 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2022-01-31 16:14:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:14:59,973 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-01-31 16:14:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:59,975 INFO L225 Difference]: With dead ends: 454 [2022-01-31 16:14:59,975 INFO L226 Difference]: Without dead ends: 453 [2022-01-31 16:14:59,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:14:59,976 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 235 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:59,977 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.9s Time] [2022-01-31 16:14:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-01-31 16:14:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2022-01-31 16:14:59,985 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-01-31 16:14:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2022-01-31 16:14:59,987 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2022-01-31 16:14:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:59,987 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2022-01-31 16:14:59,987 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-01-31 16:14:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2022-01-31 16:14:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:14:59,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:59,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:59,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:14:59,989 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash 298068108, now seen corresponding path program 1 times [2022-01-31 16:14:59,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:59,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855813941] [2022-01-31 16:14:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:59,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,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-01-31 16:15:00,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:00,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855813941] [2022-01-31 16:15:00,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855813941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:00,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:00,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:00,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052837159] [2022-01-31 16:15:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:00,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:00,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:00,185 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-01-31 16:15:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:00,817 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2022-01-31 16:15:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:00,818 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-01-31 16:15:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:00,820 INFO L225 Difference]: With dead ends: 487 [2022-01-31 16:15:00,820 INFO L226 Difference]: Without dead ends: 472 [2022-01-31 16:15:00,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:00,821 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 338 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:00,821 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.6s Time] [2022-01-31 16:15:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-31 16:15:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2022-01-31 16:15:00,831 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-01-31 16:15:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2022-01-31 16:15:00,832 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2022-01-31 16:15:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:00,833 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2022-01-31 16:15:00,833 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-01-31 16:15:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2022-01-31 16:15:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 16:15:00,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:00,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:00,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:15:00,834 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -309998534, now seen corresponding path program 1 times [2022-01-31 16:15:00,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:00,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43784847] [2022-01-31 16:15:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:00,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:01,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:01,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43784847] [2022-01-31 16:15:01,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43784847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:01,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:01,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:01,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028048115] [2022-01-31 16:15:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:01,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:01,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:01,010 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-01-31 16:15:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:02,380 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2022-01-31 16:15:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:15:02,380 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-01-31 16:15:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:02,382 INFO L225 Difference]: With dead ends: 590 [2022-01-31 16:15:02,382 INFO L226 Difference]: Without dead ends: 575 [2022-01-31 16:15:02,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:02,383 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 846 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:02,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 801 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:15:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-01-31 16:15:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2022-01-31 16:15:02,394 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-01-31 16:15:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2022-01-31 16:15:02,395 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2022-01-31 16:15:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:02,395 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2022-01-31 16:15:02,395 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-01-31 16:15:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2022-01-31 16:15:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 16:15:02,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:02,396 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-01-31 16:15:02,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:15:02,396 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash 328516868, now seen corresponding path program 1 times [2022-01-31 16:15:02,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:02,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374455816] [2022-01-31 16:15:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:02,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:02,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374455816] [2022-01-31 16:15:02,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374455816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:02,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:02,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:02,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659987800] [2022-01-31 16:15:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:02,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:02,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:02,580 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-01-31 16:15:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:03,224 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2022-01-31 16:15:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:03,225 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-01-31 16:15:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:03,226 INFO L225 Difference]: With dead ends: 455 [2022-01-31 16:15:03,226 INFO L226 Difference]: Without dead ends: 427 [2022-01-31 16:15:03,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:03,227 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 160 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:03,227 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.6s Time] [2022-01-31 16:15:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-01-31 16:15:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-01-31 16:15:03,235 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-01-31 16:15:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2022-01-31 16:15:03,236 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2022-01-31 16:15:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:03,237 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2022-01-31 16:15:03,237 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-01-31 16:15:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2022-01-31 16:15:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:15:03,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:03,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:03,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:15:03,238 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1720991068, now seen corresponding path program 1 times [2022-01-31 16:15:03,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:03,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359042630] [2022-01-31 16:15:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:03,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:15:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:03,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:03,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359042630] [2022-01-31 16:15:03,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359042630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:03,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:03,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:03,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482123852] [2022-01-31 16:15:03,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:03,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:03,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:03,404 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-01-31 16:15:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:04,193 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2022-01-31 16:15:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 16:15:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:04,195 INFO L225 Difference]: With dead ends: 453 [2022-01-31 16:15:04,195 INFO L226 Difference]: Without dead ends: 423 [2022-01-31 16:15:04,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:04,196 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 115 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:04,196 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.7s Time] [2022-01-31 16:15:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-31 16:15:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2022-01-31 16:15:04,204 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-01-31 16:15:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2022-01-31 16:15:04,205 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2022-01-31 16:15:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:04,206 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2022-01-31 16:15:04,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:15:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2022-01-31 16:15:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:15:04,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:04,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:04,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:15:04,207 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1090499838, now seen corresponding path program 1 times [2022-01-31 16:15:04,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:04,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484091907] [2022-01-31 16:15:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:04,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:04,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484091907] [2022-01-31 16:15:04,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484091907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:04,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:04,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:04,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404420843] [2022-01-31 16:15:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:04,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:04,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:04,370 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-01-31 16:15:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:05,956 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2022-01-31 16:15:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:15:05,957 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-01-31 16:15:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:05,959 INFO L225 Difference]: With dead ends: 600 [2022-01-31 16:15:05,959 INFO L226 Difference]: Without dead ends: 600 [2022-01-31 16:15:05,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-01-31 16:15:05,960 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.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:05,960 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.3s Time] [2022-01-31 16:15:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-01-31 16:15:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-01-31 16:15:05,970 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-01-31 16:15:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2022-01-31 16:15:05,972 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2022-01-31 16:15:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:05,972 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2022-01-31 16:15:05,973 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-01-31 16:15:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2022-01-31 16:15:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:05,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:05,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-01-31 16:15:05,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:15:05,974 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1506717387, now seen corresponding path program 1 times [2022-01-31 16:15:05,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:05,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136261701] [2022-01-31 16:15:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:05,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:06,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:06,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136261701] [2022-01-31 16:15:06,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136261701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:06,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:06,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:06,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286305684] [2022-01-31 16:15:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:06,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:06,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:06,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:06,150 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-01-31 16:15:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:06,778 INFO L93 Difference]: Finished difference Result 555 states and 796 transitions. [2022-01-31 16:15:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:06,778 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-01-31 16:15:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:06,780 INFO L225 Difference]: With dead ends: 555 [2022-01-31 16:15:06,780 INFO L226 Difference]: Without dead ends: 555 [2022-01-31 16:15:06,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:15:06,782 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 616 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:06,782 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.5s Time] [2022-01-31 16:15:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-01-31 16:15:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 537. [2022-01-31 16:15:06,796 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-01-31 16:15:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 773 transitions. [2022-01-31 16:15:06,798 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 773 transitions. Word has length 51 [2022-01-31 16:15:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:06,798 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 773 transitions. [2022-01-31 16:15:06,798 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-01-31 16:15:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 773 transitions. [2022-01-31 16:15:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:06,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:06,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:06,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:15:06,801 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1791177556, now seen corresponding path program 1 times [2022-01-31 16:15:06,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354672208] [2022-01-31 16:15:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:06,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:06,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354672208] [2022-01-31 16:15:06,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354672208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:06,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:06,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:06,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513203080] [2022-01-31 16:15:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:06,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:06,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:06,992 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-01-31 16:15:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:07,829 INFO L93 Difference]: Finished difference Result 624 states and 937 transitions. [2022-01-31 16:15:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:07,829 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-01-31 16:15:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:07,831 INFO L225 Difference]: With dead ends: 624 [2022-01-31 16:15:07,831 INFO L226 Difference]: Without dead ends: 624 [2022-01-31 16:15:07,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:07,832 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-01-31 16:15:07,833 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-01-31 16:15:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-01-31 16:15:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 529. [2022-01-31 16:15:07,847 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-01-31 16:15:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2022-01-31 16:15:07,849 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 51 [2022-01-31 16:15:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:07,850 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2022-01-31 16:15:07,850 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-01-31 16:15:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2022-01-31 16:15:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:15:07,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:07,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:07,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:15:07,851 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -50366668, now seen corresponding path program 1 times [2022-01-31 16:15:07,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827738654] [2022-01-31 16:15:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:07,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:07,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:07,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827738654] [2022-01-31 16:15:07,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827738654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:07,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:07,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:15:07,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464527436] [2022-01-31 16:15:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:07,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:15:07,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:15:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:15:07,976 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-01-31 16:15:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:08,421 INFO L93 Difference]: Finished difference Result 701 states and 1080 transitions. [2022-01-31 16:15:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:15:08,423 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-01-31 16:15:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:08,425 INFO L225 Difference]: With dead ends: 701 [2022-01-31 16:15:08,425 INFO L226 Difference]: Without dead ends: 701 [2022-01-31 16:15:08,426 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-01-31 16:15:08,426 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-01-31 16:15:08,426 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-01-31 16:15:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-01-31 16:15:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 524. [2022-01-31 16:15:08,440 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-01-31 16:15:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2022-01-31 16:15:08,441 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2022-01-31 16:15:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:08,441 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2022-01-31 16:15:08,442 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-01-31 16:15:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2022-01-31 16:15:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:08,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:08,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:08,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:15:08,443 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1529813192, now seen corresponding path program 1 times [2022-01-31 16:15:08,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:08,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915571777] [2022-01-31 16:15:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:08,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:08,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:08,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915571777] [2022-01-31 16:15:08,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915571777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:08,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:08,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:08,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054126556] [2022-01-31 16:15:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:08,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:08,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:08,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:08,621 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-01-31 16:15:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:09,154 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2022-01-31 16:15:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:09,155 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-01-31 16:15:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:09,157 INFO L225 Difference]: With dead ends: 544 [2022-01-31 16:15:09,157 INFO L226 Difference]: Without dead ends: 543 [2022-01-31 16:15:09,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:09,158 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-01-31 16:15:09,158 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-01-31 16:15:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-01-31 16:15:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-01-31 16:15:09,167 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-01-31 16:15:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2022-01-31 16:15:09,169 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2022-01-31 16:15:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:09,169 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2022-01-31 16:15:09,169 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-01-31 16:15:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2022-01-31 16:15:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:15:09,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:09,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:09,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:15:09,170 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1529844936, now seen corresponding path program 1 times [2022-01-31 16:15:09,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:09,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818504480] [2022-01-31 16:15:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:09,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:09,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:09,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818504480] [2022-01-31 16:15:09,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818504480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:09,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:09,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:09,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235339169] [2022-01-31 16:15:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:09,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:09,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:09,342 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-01-31 16:15:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:10,014 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2022-01-31 16:15:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:10,016 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-01-31 16:15:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:10,018 INFO L225 Difference]: With dead ends: 559 [2022-01-31 16:15:10,018 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 16:15:10,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:10,019 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-01-31 16:15:10,019 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-01-31 16:15:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 16:15:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2022-01-31 16:15:10,029 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-01-31 16:15:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2022-01-31 16:15:10,031 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2022-01-31 16:15:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:10,031 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2022-01-31 16:15:10,031 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-01-31 16:15:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2022-01-31 16:15:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:10,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:10,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] [2022-01-31 16:15:10,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:15:10,032 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1874017512, now seen corresponding path program 1 times [2022-01-31 16:15:10,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:10,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955315345] [2022-01-31 16:15:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:10,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:15:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 16:15:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:10,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955315345] [2022-01-31 16:15:10,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955315345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:10,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:10,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:10,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634649484] [2022-01-31 16:15:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:10,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:10,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:10,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:10,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:10,158 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-01-31 16:15:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:10,801 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2022-01-31 16:15:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:10,802 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-01-31 16:15:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:10,804 INFO L225 Difference]: With dead ends: 549 [2022-01-31 16:15:10,804 INFO L226 Difference]: Without dead ends: 549 [2022-01-31 16:15:10,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:10,805 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 188 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:10,805 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.6s Time] [2022-01-31 16:15:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-31 16:15:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2022-01-31 16:15:10,815 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-01-31 16:15:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2022-01-31 16:15:10,817 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2022-01-31 16:15:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:10,817 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2022-01-31 16:15:10,817 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-01-31 16:15:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2022-01-31 16:15:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:10,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:10,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:10,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:15:10,818 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2132872221, now seen corresponding path program 1 times [2022-01-31 16:15:10,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:10,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092409136] [2022-01-31 16:15:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:10,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 16:15:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:10,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:10,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092409136] [2022-01-31 16:15:10,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092409136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:10,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:10,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:10,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058893223] [2022-01-31 16:15:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:10,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:10,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:10,996 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-01-31 16:15:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:12,095 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2022-01-31 16:15:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:12,096 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-01-31 16:15:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:12,100 INFO L225 Difference]: With dead ends: 671 [2022-01-31 16:15:12,100 INFO L226 Difference]: Without dead ends: 639 [2022-01-31 16:15:12,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:12,100 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 561 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:12,102 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.9s Time] [2022-01-31 16:15:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-01-31 16:15:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2022-01-31 16:15:12,111 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-01-31 16:15:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2022-01-31 16:15:12,113 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2022-01-31 16:15:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:12,113 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2022-01-31 16:15:12,113 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-01-31 16:15:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2022-01-31 16:15:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 16:15:12,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:12,114 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-01-31 16:15:12,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 16:15:12,114 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash 983025775, now seen corresponding path program 1 times [2022-01-31 16:15:12,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:12,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844157566] [2022-01-31 16:15:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:12,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:12,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:12,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844157566] [2022-01-31 16:15:12,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844157566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:12,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:12,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:12,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140105639] [2022-01-31 16:15:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:12,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:12,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:12,373 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-01-31 16:15:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:12,993 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2022-01-31 16:15:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:12,994 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-01-31 16:15:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:12,995 INFO L225 Difference]: With dead ends: 390 [2022-01-31 16:15:12,995 INFO L226 Difference]: Without dead ends: 390 [2022-01-31 16:15:12,995 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-01-31 16:15:12,996 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 153 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:12,996 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.6s Time] [2022-01-31 16:15:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-01-31 16:15:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2022-01-31 16:15:13,002 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-01-31 16:15:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-01-31 16:15:13,003 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-01-31 16:15:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:13,004 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-01-31 16:15:13,004 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-01-31 16:15:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-01-31 16:15:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:13,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:13,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:13,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 16:15:13,005 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1006609107, now seen corresponding path program 1 times [2022-01-31 16:15:13,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115677448] [2022-01-31 16:15:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:13,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:13,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115677448] [2022-01-31 16:15:13,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115677448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:13,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:13,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:13,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005085273] [2022-01-31 16:15:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:13,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:13,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:13,224 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-01-31 16:15:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:13,936 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2022-01-31 16:15:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:13,937 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-01-31 16:15:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:13,939 INFO L225 Difference]: With dead ends: 343 [2022-01-31 16:15:13,939 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 16:15:13,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:13,940 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 155 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:13,941 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.7s Time] [2022-01-31 16:15:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 16:15:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2022-01-31 16:15:13,946 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-01-31 16:15:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2022-01-31 16:15:13,947 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2022-01-31 16:15:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:13,947 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2022-01-31 16:15:13,947 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-01-31 16:15:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2022-01-31 16:15:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:15:13,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:13,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:13,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 16:15:13,948 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -763479135, now seen corresponding path program 1 times [2022-01-31 16:15:13,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:13,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172571674] [2022-01-31 16:15:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:13,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:14,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:14,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172571674] [2022-01-31 16:15:14,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172571674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:14,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:14,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:14,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128530841] [2022-01-31 16:15:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:14,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:14,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:14,142 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-01-31 16:15:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:14,802 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2022-01-31 16:15:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:14,802 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-01-31 16:15:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:14,804 INFO L225 Difference]: With dead ends: 316 [2022-01-31 16:15:14,804 INFO L226 Difference]: Without dead ends: 316 [2022-01-31 16:15:14,804 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-01-31 16:15:14,805 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:14,805 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.5s Time] [2022-01-31 16:15:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-01-31 16:15:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-01-31 16:15:14,810 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-01-31 16:15:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2022-01-31 16:15:14,811 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 66 [2022-01-31 16:15:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:14,811 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2022-01-31 16:15:14,811 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-01-31 16:15:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2022-01-31 16:15:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:15:14,812 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:14,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:14,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 16:15:14,812 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1216763617, now seen corresponding path program 1 times [2022-01-31 16:15:14,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:14,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538309586] [2022-01-31 16:15:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:14,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:14,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538309586] [2022-01-31 16:15:14,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538309586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:14,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:14,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:14,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123214011] [2022-01-31 16:15:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:14,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:14,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:14,990 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-01-31 16:15:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:15,358 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2022-01-31 16:15:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:15,358 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-01-31 16:15:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:15,360 INFO L225 Difference]: With dead ends: 330 [2022-01-31 16:15:15,360 INFO L226 Difference]: Without dead ends: 330 [2022-01-31 16:15:15,360 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-01-31 16:15:15,360 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-01-31 16:15:15,360 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-01-31 16:15:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-01-31 16:15:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2022-01-31 16:15:15,366 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-01-31 16:15:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2022-01-31 16:15:15,366 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2022-01-31 16:15:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:15,367 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2022-01-31 16:15:15,367 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-01-31 16:15:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2022-01-31 16:15:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:15,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:15,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:15,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 16:15:15,368 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 107043316, now seen corresponding path program 1 times [2022-01-31 16:15:15,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897734711] [2022-01-31 16:15:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:15,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:15,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897734711] [2022-01-31 16:15:15,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897734711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:15,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:15,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:15,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930846369] [2022-01-31 16:15:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:15,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:15,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:15,505 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-01-31 16:15:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:15,838 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2022-01-31 16:15:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:15,838 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-01-31 16:15:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:15,840 INFO L225 Difference]: With dead ends: 474 [2022-01-31 16:15:15,840 INFO L226 Difference]: Without dead ends: 474 [2022-01-31 16:15:15,841 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-01-31 16:15:15,841 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-01-31 16:15:15,841 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-01-31 16:15:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-01-31 16:15:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2022-01-31 16:15:15,856 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-01-31 16:15:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2022-01-31 16:15:15,857 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2022-01-31 16:15:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:15,857 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2022-01-31 16:15:15,858 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-01-31 16:15:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2022-01-31 16:15:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:15:15,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:15,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:15,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 16:15:15,859 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1007458050, now seen corresponding path program 1 times [2022-01-31 16:15:15,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7739827] [2022-01-31 16:15:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:15,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,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-01-31 16:15:16,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7739827] [2022-01-31 16:15:16,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7739827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:16,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:16,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:16,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791878669] [2022-01-31 16:15:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:16,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:16,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:16,004 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-01-31 16:15:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:16,834 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2022-01-31 16:15:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:16,834 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-01-31 16:15:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:16,836 INFO L225 Difference]: With dead ends: 529 [2022-01-31 16:15:16,836 INFO L226 Difference]: Without dead ends: 529 [2022-01-31 16:15:16,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:16,837 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 328 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-01-31 16:15:16,837 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-01-31 16:15:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-01-31 16:15:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2022-01-31 16:15:16,845 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-01-31 16:15:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-01-31 16:15:16,846 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 70 [2022-01-31 16:15:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:16,847 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-01-31 16:15:16,847 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-01-31 16:15:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-01-31 16:15:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 16:15:16,847 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:16,848 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-01-31 16:15:16,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 16:15:16,848 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2035760571, now seen corresponding path program 1 times [2022-01-31 16:15:16,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259264506] [2022-01-31 16:15:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:16,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 16:15:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:17,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:17,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259264506] [2022-01-31 16:15:17,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259264506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:17,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:17,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:17,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691284764] [2022-01-31 16:15:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:17,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:17,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:17,095 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-01-31 16:15:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:17,436 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2022-01-31 16:15:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:17,437 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-01-31 16:15:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:17,439 INFO L225 Difference]: With dead ends: 493 [2022-01-31 16:15:17,439 INFO L226 Difference]: Without dead ends: 493 [2022-01-31 16:15:17,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:17,439 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 208 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-01-31 16:15:17,440 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-01-31 16:15:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-01-31 16:15:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2022-01-31 16:15:17,447 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-01-31 16:15:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2022-01-31 16:15:17,448 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2022-01-31 16:15:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:17,449 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2022-01-31 16:15:17,449 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-01-31 16:15:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2022-01-31 16:15:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 16:15:17,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:17,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:17,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 16:15:17,450 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1777696599, now seen corresponding path program 1 times [2022-01-31 16:15:17,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:17,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767550847] [2022-01-31 16:15:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:17,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 16:15:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 16:15:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:17,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-01-31 16:15:17,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:17,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767550847] [2022-01-31 16:15:17,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767550847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:17,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:17,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:17,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428822095] [2022-01-31 16:15:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:17,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:17,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:17,628 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-01-31 16:15:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:18,349 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2022-01-31 16:15:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:18,349 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-01-31 16:15:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:18,351 INFO L225 Difference]: With dead ends: 450 [2022-01-31 16:15:18,351 INFO L226 Difference]: Without dead ends: 450 [2022-01-31 16:15:18,352 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-01-31 16:15:18,352 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-01-31 16:15:18,352 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-01-31 16:15:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-31 16:15:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2022-01-31 16:15:18,359 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-01-31 16:15:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2022-01-31 16:15:18,360 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2022-01-31 16:15:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:18,360 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2022-01-31 16:15:18,360 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-01-31 16:15:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2022-01-31 16:15:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 16:15:18,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:18,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:18,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 16:15:18,362 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1836701912, now seen corresponding path program 1 times [2022-01-31 16:15:18,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:18,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586159167] [2022-01-31 16:15:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:18,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 16:15:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:18,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586159167] [2022-01-31 16:15:18,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586159167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:18,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:18,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 16:15:18,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609184850] [2022-01-31 16:15:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:18,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 16:15:18,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 16:15:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:18,765 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-01-31 16:15:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:19,426 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2022-01-31 16:15:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:19,426 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-01-31 16:15:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:19,428 INFO L225 Difference]: With dead ends: 483 [2022-01-31 16:15:19,428 INFO L226 Difference]: Without dead ends: 461 [2022-01-31 16:15:19,428 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-01-31 16:15:19,428 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 211 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:19,428 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.6s Time] [2022-01-31 16:15:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-31 16:15:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-01-31 16:15:19,434 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-01-31 16:15:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2022-01-31 16:15:19,435 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2022-01-31 16:15:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:19,435 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2022-01-31 16:15:19,435 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-01-31 16:15:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2022-01-31 16:15:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 16:15:19,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:19,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:19,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 16:15:19,437 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1857542518, now seen corresponding path program 1 times [2022-01-31 16:15:19,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:19,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223946356] [2022-01-31 16:15:19,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:19,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:15:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:19,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:19,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223946356] [2022-01-31 16:15:19,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223946356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:19,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:19,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 16:15:19,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629628912] [2022-01-31 16:15:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:19,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 16:15:19,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 16:15:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:19,819 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-01-31 16:15:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:20,737 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2022-01-31 16:15:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:20,747 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-01-31 16:15:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:20,749 INFO L225 Difference]: With dead ends: 481 [2022-01-31 16:15:20,750 INFO L226 Difference]: Without dead ends: 459 [2022-01-31 16:15:20,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 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-01-31 16:15:20,750 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:20,751 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.9s Time] [2022-01-31 16:15:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-31 16:15:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2022-01-31 16:15:20,781 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-01-31 16:15:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2022-01-31 16:15:20,783 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2022-01-31 16:15:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:20,783 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2022-01-31 16:15:20,787 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-01-31 16:15:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2022-01-31 16:15:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-31 16:15:20,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:20,788 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-01-31 16:15:20,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 16:15:20,789 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1054192149, now seen corresponding path program 1 times [2022-01-31 16:15:20,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:20,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296038688] [2022-01-31 16:15:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:20,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 16:15:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 16:15:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,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-01-31 16:15:21,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296038688] [2022-01-31 16:15:21,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296038688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:21,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:21,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 16:15:21,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077140383] [2022-01-31 16:15:21,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:21,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 16:15:21,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 16:15:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:21,185 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-01-31 16:15:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:22,539 INFO L93 Difference]: Finished difference Result 467 states and 639 transitions. [2022-01-31 16:15:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 16:15:22,540 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-01-31 16:15:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:22,541 INFO L225 Difference]: With dead ends: 467 [2022-01-31 16:15:22,541 INFO L226 Difference]: Without dead ends: 434 [2022-01-31 16:15:22,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 16:15:22,542 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 405 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:22,542 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.1s Time] [2022-01-31 16:15:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-01-31 16:15:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 424. [2022-01-31 16:15:22,548 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-01-31 16:15:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2022-01-31 16:15:22,550 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2022-01-31 16:15:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:22,550 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2022-01-31 16:15:22,550 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-01-31 16:15:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2022-01-31 16:15:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-31 16:15:22,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:22,551 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-01-31 16:15:22,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 16:15:22,552 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1385513232, now seen corresponding path program 1 times [2022-01-31 16:15:22,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112880813] [2022-01-31 16:15:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:22,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 16:15:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 16:15:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 16:15:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:22,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112880813] [2022-01-31 16:15:22,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112880813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:22,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:22,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 16:15:22,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364766119] [2022-01-31 16:15:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:22,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:15:22,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:15:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:15:22,993 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-01-31 16:15:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:23,836 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2022-01-31 16:15:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 16:15:23,837 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-01-31 16:15:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:23,839 INFO L225 Difference]: With dead ends: 478 [2022-01-31 16:15:23,839 INFO L226 Difference]: Without dead ends: 454 [2022-01-31 16:15:23,839 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-01-31 16:15:23,840 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 137 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:23,840 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.7s Time] [2022-01-31 16:15:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-01-31 16:15:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-01-31 16:15:23,847 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-01-31 16:15:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2022-01-31 16:15:23,848 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2022-01-31 16:15:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:23,849 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2022-01-31 16:15:23,849 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-01-31 16:15:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2022-01-31 16:15:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-31 16:15:23,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:23,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:23,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 16:15:23,850 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash -205451642, now seen corresponding path program 1 times [2022-01-31 16:15:23,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:23,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317036516] [2022-01-31 16:15:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:23,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:15:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 16:15:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 16:15:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:24,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:24,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317036516] [2022-01-31 16:15:24,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317036516] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:24,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:24,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 16:15:24,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460146155] [2022-01-31 16:15:24,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:24,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:15:24,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:15:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:15:24,295 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-01-31 16:15:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:25,327 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2022-01-31 16:15:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 16:15:25,328 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-01-31 16:15:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:25,330 INFO L225 Difference]: With dead ends: 480 [2022-01-31 16:15:25,330 INFO L226 Difference]: Without dead ends: 443 [2022-01-31 16:15:25,330 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-01-31 16:15:25,331 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.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:25,331 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.9s Time] [2022-01-31 16:15:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-01-31 16:15:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2022-01-31 16:15:25,338 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-01-31 16:15:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2022-01-31 16:15:25,340 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2022-01-31 16:15:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:25,340 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2022-01-31 16:15:25,340 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-01-31 16:15:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2022-01-31 16:15:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 16:15:25,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:25,342 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-01-31 16:15:25,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 16:15:25,342 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -790809002, now seen corresponding path program 1 times [2022-01-31 16:15:25,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:25,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88152459] [2022-01-31 16:15:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:25,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 16:15:25,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88152459] [2022-01-31 16:15:25,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88152459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:25,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:25,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:25,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221436311] [2022-01-31 16:15:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:25,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:25,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:25,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:25,578 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-01-31 16:15:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:26,168 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2022-01-31 16:15:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:26,169 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-01-31 16:15:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:26,170 INFO L225 Difference]: With dead ends: 420 [2022-01-31 16:15:26,171 INFO L226 Difference]: Without dead ends: 420 [2022-01-31 16:15:26,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:26,171 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 156 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-01-31 16:15:26,171 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-01-31 16:15:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-01-31 16:15:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-01-31 16:15:26,178 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-01-31 16:15:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2022-01-31 16:15:26,179 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2022-01-31 16:15:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:26,179 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2022-01-31 16:15:26,179 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-01-31 16:15:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2022-01-31 16:15:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-31 16:15:26,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:26,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:26,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 16:15:26,181 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -474317813, now seen corresponding path program 1 times [2022-01-31 16:15:26,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:26,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155640614] [2022-01-31 16:15:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:26,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 16:15:26,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155640614] [2022-01-31 16:15:26,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155640614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:26,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:26,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:26,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493203248] [2022-01-31 16:15:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:26,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:26,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:26,449 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-01-31 16:15:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:26,998 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2022-01-31 16:15:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:26,998 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-01-31 16:15:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:27,000 INFO L225 Difference]: With dead ends: 547 [2022-01-31 16:15:27,000 INFO L226 Difference]: Without dead ends: 547 [2022-01-31 16:15:27,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:27,000 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:27,001 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.5s Time] [2022-01-31 16:15:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-01-31 16:15:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2022-01-31 16:15:27,008 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-01-31 16:15:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2022-01-31 16:15:27,009 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2022-01-31 16:15:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:27,009 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2022-01-31 16:15:27,009 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-01-31 16:15:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2022-01-31 16:15:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-31 16:15:27,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:27,010 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-01-31 16:15:27,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 16:15:27,011 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -286096315, now seen corresponding path program 1 times [2022-01-31 16:15:27,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:27,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254775737] [2022-01-31 16:15:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:27,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 16:15:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 16:15:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 16:15:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:27,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254775737] [2022-01-31 16:15:27,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254775737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:27,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:27,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 16:15:27,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666390076] [2022-01-31 16:15:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:27,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:15:27,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:15:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-01-31 16:15:27,494 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-01-31 16:15:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:28,818 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2022-01-31 16:15:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 16:15:28,818 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-01-31 16:15:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:28,820 INFO L225 Difference]: With dead ends: 413 [2022-01-31 16:15:28,820 INFO L226 Difference]: Without dead ends: 354 [2022-01-31 16:15:28,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 16:15:28,821 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, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:28,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 492 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:15:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-31 16:15:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2022-01-31 16:15:28,827 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-01-31 16:15:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2022-01-31 16:15:28,828 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2022-01-31 16:15:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:28,829 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2022-01-31 16:15:28,829 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-01-31 16:15:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2022-01-31 16:15:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-31 16:15:28,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:28,830 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-01-31 16:15:28,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 16:15:28,831 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 762913287, now seen corresponding path program 1 times [2022-01-31 16:15:28,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:28,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971632911] [2022-01-31 16:15:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:28,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:15:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 16:15:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 16:15:29,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971632911] [2022-01-31 16:15:29,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971632911] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:15:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257484465] [2022-01-31 16:15:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:29,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:15:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:15:29,131 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-01-31 16:15:29,156 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-01-31 16:15:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:29,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-31 16:15:29,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:15:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-01-31 16:15:29,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 16:15:29,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257484465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:29,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 16:15:29,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-01-31 16:15:29,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590746541] [2022-01-31 16:15:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:29,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 16:15:29,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 16:15:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:29,719 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-01-31 16:15:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:29,724 INFO L93 Difference]: Finished difference Result 341 states and 434 transitions. [2022-01-31 16:15:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 16:15:29,724 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-01-31 16:15:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:29,726 INFO L225 Difference]: With dead ends: 341 [2022-01-31 16:15:29,726 INFO L226 Difference]: Without dead ends: 341 [2022-01-31 16:15:29,726 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-01-31 16:15:29,727 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-01-31 16:15:29,727 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-01-31 16:15:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-01-31 16:15:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-01-31 16:15:29,731 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-01-31 16:15:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 434 transitions. [2022-01-31 16:15:29,732 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 434 transitions. Word has length 163 [2022-01-31 16:15:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:29,732 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 434 transitions. [2022-01-31 16:15:29,733 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-01-31 16:15:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 434 transitions. [2022-01-31 16:15:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-31 16:15:29,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:29,734 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-01-31 16:15:29,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 16:15:29,956 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-01-31 16:15:29,957 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1424868086, now seen corresponding path program 1 times [2022-01-31 16:15:29,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287764772] [2022-01-31 16:15:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:29,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 16:15:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 16:15:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 16:15:30,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:30,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287764772] [2022-01-31 16:15:30,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287764772] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:15:30,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199518893] [2022-01-31 16:15:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:30,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:15:30,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:15:30,252 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-01-31 16:15:30,261 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-01-31 16:15:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:30,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 16:15:30,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:15:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 16:15:30,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 16:15:30,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199518893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:30,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 16:15:30,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2022-01-31 16:15:30,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374037493] [2022-01-31 16:15:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:30,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:30,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:30,772 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-01-31 16:15:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:30,814 INFO L93 Difference]: Finished difference Result 374 states and 481 transitions. [2022-01-31 16:15:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:30,814 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-01-31 16:15:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:30,816 INFO L225 Difference]: With dead ends: 374 [2022-01-31 16:15:30,816 INFO L226 Difference]: Without dead ends: 372 [2022-01-31 16:15:30,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:30,817 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-01-31 16:15:30,817 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-01-31 16:15:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-01-31 16:15:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2022-01-31 16:15:30,822 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-01-31 16:15:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 463 transitions. [2022-01-31 16:15:30,823 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 463 transitions. Word has length 163 [2022-01-31 16:15:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:30,824 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 463 transitions. [2022-01-31 16:15:30,824 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-01-31 16:15:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 463 transitions. [2022-01-31 16:15:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-31 16:15:30,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:30,826 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-01-31 16:15:30,861 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-01-31 16:15:31,051 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-01-31 16:15:31,052 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:31,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -589316084, now seen corresponding path program 1 times [2022-01-31 16:15:31,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:31,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787204673] [2022-01-31 16:15:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:31,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 16:15:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 16:15:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 16:15:31,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:31,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787204673] [2022-01-31 16:15:31,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787204673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:31,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:31,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:31,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046120834] [2022-01-31 16:15:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:31,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:31,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:31,363 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-01-31 16:15:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:31,881 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2022-01-31 16:15:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:31,881 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-01-31 16:15:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:31,883 INFO L225 Difference]: With dead ends: 428 [2022-01-31 16:15:31,883 INFO L226 Difference]: Without dead ends: 428 [2022-01-31 16:15:31,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:31,884 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 150 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:31,884 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.5s Time] [2022-01-31 16:15:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-01-31 16:15:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2022-01-31 16:15:31,890 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-01-31 16:15:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2022-01-31 16:15:31,891 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 164 [2022-01-31 16:15:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:31,891 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2022-01-31 16:15:31,891 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-01-31 16:15:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2022-01-31 16:15:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-31 16:15:31,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:31,894 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-01-31 16:15:31,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 16:15:31,894 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -158276280, now seen corresponding path program 1 times [2022-01-31 16:15:31,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44282381] [2022-01-31 16:15:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:31,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 16:15:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 16:15:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 16:15:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 16:15:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-01-31 16:15:32,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44282381] [2022-01-31 16:15:32,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44282381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:32,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:32,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:32,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567123530] [2022-01-31 16:15:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:32,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:32,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:32,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:32,186 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-01-31 16:15:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:32,724 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2022-01-31 16:15:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:32,724 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-01-31 16:15:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:32,726 INFO L225 Difference]: With dead ends: 354 [2022-01-31 16:15:32,726 INFO L226 Difference]: Without dead ends: 354 [2022-01-31 16:15:32,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:32,727 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:32,728 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.5s Time] [2022-01-31 16:15:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-31 16:15:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2022-01-31 16:15:32,739 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-01-31 16:15:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2022-01-31 16:15:32,739 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2022-01-31 16:15:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:32,740 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2022-01-31 16:15:32,740 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-01-31 16:15:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2022-01-31 16:15:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-31 16:15:32,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:32,742 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-01-31 16:15:32,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 16:15:32,742 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1341132510, now seen corresponding path program 1 times [2022-01-31 16:15:32,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301143422] [2022-01-31 16:15:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:32,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 16:15:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 16:15:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 16:15:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 16:15:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 16:15:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 16:15:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 16:15:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-01-31 16:15:33,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:33,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301143422] [2022-01-31 16:15:33,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301143422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:33,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:33,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:15:33,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74929093] [2022-01-31 16:15:33,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:33,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:15:33,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:15:33,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:33,040 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-01-31 16:15:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:33,372 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2022-01-31 16:15:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:33,372 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-01-31 16:15:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:33,373 INFO L225 Difference]: With dead ends: 290 [2022-01-31 16:15:33,373 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 16:15:33,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:33,373 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-01-31 16:15:33,373 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-01-31 16:15:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 16:15:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 16:15:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 16:15:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 16:15:33,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-01-31 16:15:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:33,374 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 16:15:33,374 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-01-31 16:15:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 16:15:33,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 16:15:33,377 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:15:33,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 16:15:33,380 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-01-31 16:15:33,381 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:15:33,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:33 BasicIcfg [2022-01-31 16:15:33,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:15:33,383 INFO L158 Benchmark]: Toolchain (without parser) took 50066.41ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 126.0MB in the beginning and 107.4MB in the end (delta: 18.7MB). Peak memory consumption was 103.2MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,383 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 68.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:15:33,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.44ms. Allocated memory is still 176.2MB. Free memory was 125.8MB in the beginning and 143.6MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,384 INFO L158 Benchmark]: Boogie Preprocessor took 66.78ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 140.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,384 INFO L158 Benchmark]: RCFGBuilder took 776.11ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 100.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,384 INFO L158 Benchmark]: IcfgTransformer took 40.20ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 94.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,384 INFO L158 Benchmark]: TraceAbstraction took 48774.95ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 94.3MB in the beginning and 107.4MB in the end (delta: -13.0MB). Peak memory consumption was 71.9MB. Max. memory is 8.0GB. [2022-01-31 16:15:33,385 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.11ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 68.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 401.44ms. Allocated memory is still 176.2MB. Free memory was 125.8MB in the beginning and 143.6MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.78ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 140.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 776.11ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 100.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * IcfgTransformer took 40.20ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 94.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 48774.95ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 94.3MB in the beginning and 107.4MB in the end (delta: -13.0MB). Peak memory consumption was 71.9MB. 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: 48.7s, OverallIterations: 47, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14843 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14663 mSDsluCounter, 50856 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37805 mSDsCounter, 6499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48238 IncrementalHoareTripleChecker+Invalid, 54737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6499 mSolverCounterUnsat, 13051 mSDtfsCounter, 48238 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, 9.8s 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.7s AutomataMinimizationTime, 47 MinimizatonAttempts, 2092 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s 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-01-31 16:15:33,413 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...