/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/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:15:36,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:15:36,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:15:36,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:15:36,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:15:36,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:15:36,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:15:36,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:15:36,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:15:36,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:15:36,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:15:36,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:15:36,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:15:36,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:15:36,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:15:36,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:15:36,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:15:36,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:15:36,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:15:36,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:15:36,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:15:36,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:15:36,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:15:36,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:15:36,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:15:36,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:15:36,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:15:36,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:15:36,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:15:36,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:15:36,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:15:36,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:15:36,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:15:36,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:15:36,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:15:36,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:15:36,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:15:36,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:15:36,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:15:36,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:15:36,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:15:36,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:15:36,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:15:36,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:15:36,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:15:36,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:15:36,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:15:36,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:15:36,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:15:36,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:15:36,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:15:36,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:15:36,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:15:36,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:15:36,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:15:36,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:36,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:15:36,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:15:36,417 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:15:36,417 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:15:36,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:15:36,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:15:36,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:15:36,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:15:36,621 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:15:36,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-01-31 16:15:36,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cc85e04/53eae9ca01cd4138a2bd3b85e8b1a89e/FLAGbbbdd60e7 [2022-01-31 16:15:37,040 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:15:37,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-01-31 16:15:37,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cc85e04/53eae9ca01cd4138a2bd3b85e8b1a89e/FLAGbbbdd60e7 [2022-01-31 16:15:37,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cc85e04/53eae9ca01cd4138a2bd3b85e8b1a89e [2022-01-31 16:15:37,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:15:37,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:15:37,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:37,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:15:37,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:15:37,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26255301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37, skipping insertion in model container [2022-01-31 16:15:37,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:15:37,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:15:37,765 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/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-01-31 16:15:37,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:37,779 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:15:37,865 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/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-01-31 16:15:37,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:15:37,880 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:15:37,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37 WrapperNode [2022-01-31 16:15:37,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:15:37,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:15:37,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:15:37,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:15:37,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:15:37,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:15:37,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:15:37,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:15:37,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (1/1) ... [2022-01-31 16:15:37,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:15:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:15:37,984 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:15:38,008 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:15:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:15:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:15:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:15:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 16:15:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 16:15:38,030 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 16:15:38,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:15:38,030 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 16:15:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 16:15:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 16:15:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 16:15:38,034 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 16:15:38,034 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 16:15:38,034 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 16:15:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 16:15:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 16:15:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:15:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:15:38,183 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:15:38,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:15:38,275 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,374 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-31 16:15:38,374 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-31 16:15:38,378 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,402 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 16:15:38,403 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 16:15:38,458 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,476 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 16:15:38,477 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 16:15:38,483 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,552 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 16:15:38,552 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 16:15:38,555 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 16:15:38,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 16:15:38,576 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:15:38,593 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 16:15:38,594 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 16:15:38,618 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:15:38,626 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:15:38,626 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 16:15:38,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:38 BoogieIcfgContainer [2022-01-31 16:15:38,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:15:38,634 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:15:38,634 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:15:38,635 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:15:38,638 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:38" (1/1) ... [2022-01-31 16:15:38,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:38 BasicIcfg [2022-01-31 16:15:38,703 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:15:38,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:15:38,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:15:38,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:15:38,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:15:37" (1/4) ... [2022-01-31 16:15:38,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:38, skipping insertion in model container [2022-01-31 16:15:38,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:15:37" (2/4) ... [2022-01-31 16:15:38,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:15:38, skipping insertion in model container [2022-01-31 16:15:38,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:15:38" (3/4) ... [2022-01-31 16:15:38,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:38, skipping insertion in model container [2022-01-31 16:15:38,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:15:38" (4/4) ... [2022-01-31 16:15:38,711 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.cJordan [2022-01-31 16:15:38,715 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:15:38,716 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:15:38,748 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:15:38,754 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:15:38,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:15:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-31 16:15:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 16:15:38,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:38,778 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:15:38,778 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash 685042341, now seen corresponding path program 1 times [2022-01-31 16:15:38,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872005177] [2022-01-31 16:15:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:38,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,181 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:39,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:39,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872005177] [2022-01-31 16:15:39,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872005177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:39,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:39,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:15:39,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291806155] [2022-01-31 16:15:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:39,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:15:39,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:15:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:39,228 INFO L87 Difference]: Start difference. First operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 16:15:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:40,107 INFO L93 Difference]: Finished difference Result 267 states and 384 transitions. [2022-01-31 16:15:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:15:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 16:15:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:40,128 INFO L225 Difference]: With dead ends: 267 [2022-01-31 16:15:40,129 INFO L226 Difference]: Without dead ends: 256 [2022-01-31 16:15:40,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:15:40,133 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:40,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-31 16:15:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-01-31 16:15:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-31 16:15:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-01-31 16:15:40,200 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-01-31 16:15:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:40,201 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-01-31 16:15:40,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 16:15:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-01-31 16:15:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 16:15:40,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:40,202 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] [2022-01-31 16:15:40,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:15:40,203 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1276904425, now seen corresponding path program 1 times [2022-01-31 16:15:40,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:40,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040382372] [2022-01-31 16:15:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:40,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,349 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:40,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:40,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040382372] [2022-01-31 16:15:40,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040382372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:40,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:40,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:40,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909407616] [2022-01-31 16:15:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:40,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:40,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:40,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:40,352 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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:15:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:40,897 INFO L93 Difference]: Finished difference Result 344 states and 470 transitions. [2022-01-31 16:15:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:40,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 28 [2022-01-31 16:15:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:40,903 INFO L225 Difference]: With dead ends: 344 [2022-01-31 16:15:40,903 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 16:15:40,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:40,910 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 533 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:40,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 459 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 16:15:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-01-31 16:15:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-01-31 16:15:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-01-31 16:15:40,935 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-01-31 16:15:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:40,936 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-01-31 16:15:40,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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:15:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-01-31 16:15:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 16:15:40,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:40,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:40,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:15:40,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 42368072, now seen corresponding path program 1 times [2022-01-31 16:15:40,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:40,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058328643] [2022-01-31 16:15:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:40,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,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:15:41,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:41,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058328643] [2022-01-31 16:15:41,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058328643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:41,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:41,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:41,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245061413] [2022-01-31 16:15:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:41,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:41,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:41,078 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:41,515 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-01-31 16:15:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:41,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-31 16:15:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:41,517 INFO L225 Difference]: With dead ends: 362 [2022-01-31 16:15:41,518 INFO L226 Difference]: Without dead ends: 362 [2022-01-31 16:15:41,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:15:41,519 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 568 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:41,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 378 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-01-31 16:15:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-01-31 16:15:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-01-31 16:15:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-01-31 16:15:41,558 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-01-31 16:15:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:41,558 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-01-31 16:15:41,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-01-31 16:15:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 16:15:41,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:41,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:41,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:15:41,561 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1039161410, now seen corresponding path program 1 times [2022-01-31 16:15:41,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069795735] [2022-01-31 16:15:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:41,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,723 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:41,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:41,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069795735] [2022-01-31 16:15:41,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069795735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:41,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:41,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:15:41,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796831910] [2022-01-31 16:15:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:41,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:15:41,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:15:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:15:41,725 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:42,154 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2022-01-31 16:15:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:15:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-31 16:15:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:42,159 INFO L225 Difference]: With dead ends: 340 [2022-01-31 16:15:42,159 INFO L226 Difference]: Without dead ends: 340 [2022-01-31 16:15:42,159 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:15:42,160 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 343 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:42,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 385 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-01-31 16:15:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-01-31 16:15:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-01-31 16:15:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-01-31 16:15:42,183 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-01-31 16:15:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:42,188 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-01-31 16:15:42,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:15:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-01-31 16:15:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:15:42,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:42,196 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:15:42,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:15:42,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 827623692, now seen corresponding path program 1 times [2022-01-31 16:15:42,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901957600] [2022-01-31 16:15:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:42,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:42,353 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:42,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:42,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901957600] [2022-01-31 16:15:42,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901957600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:42,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:42,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:42,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514897836] [2022-01-31 16:15:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:42,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:42,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:42,355 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:42,963 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2022-01-31 16:15:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 16:15:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:42,966 INFO L225 Difference]: With dead ends: 319 [2022-01-31 16:15:42,966 INFO L226 Difference]: Without dead ends: 319 [2022-01-31 16:15:42,967 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:15:42,970 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 744 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:42,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 543 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 16:15:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-01-31 16:15:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-01-31 16:15:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-01-31 16:15:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-01-31 16:15:42,989 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-01-31 16:15:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:42,989 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-01-31 16:15:42,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:15:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-01-31 16:15:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 16:15:42,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:42,991 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:15:42,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:15:42,991 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1073883700, now seen corresponding path program 1 times [2022-01-31 16:15:42,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516637438] [2022-01-31 16:15:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:42,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,251 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:43,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:43,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516637438] [2022-01-31 16:15:43,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516637438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:43,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:43,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:43,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615078033] [2022-01-31 16:15:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:43,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:43,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:43,253 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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:15:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:44,065 INFO L93 Difference]: Finished difference Result 322 states and 425 transitions. [2022-01-31 16:15:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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 45 [2022-01-31 16:15:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:44,068 INFO L225 Difference]: With dead ends: 322 [2022-01-31 16:15:44,068 INFO L226 Difference]: Without dead ends: 322 [2022-01-31 16:15:44,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:44,069 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 527 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:44,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 417 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-31 16:15:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-01-31 16:15:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-01-31 16:15:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-01-31 16:15:44,080 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-01-31 16:15:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:44,080 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-01-31 16:15:44,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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:15:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-01-31 16:15:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:15:44,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:44,082 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:15:44,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:15:44,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1039481029, now seen corresponding path program 1 times [2022-01-31 16:15:44,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691844720] [2022-01-31 16:15:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:44,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:44,312 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:44,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691844720] [2022-01-31 16:15:44,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691844720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:44,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:44,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:44,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685222354] [2022-01-31 16:15:44,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:44,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:44,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:44,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:44,314 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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:15:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:45,209 INFO L93 Difference]: Finished difference Result 322 states and 424 transitions. [2022-01-31 16:15:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:45,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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 46 [2022-01-31 16:15:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:45,211 INFO L225 Difference]: With dead ends: 322 [2022-01-31 16:15:45,212 INFO L226 Difference]: Without dead ends: 322 [2022-01-31 16:15:45,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:45,213 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 645 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:45,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 584 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 16:15:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-31 16:15:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-01-31 16:15:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-01-31 16:15:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-01-31 16:15:45,222 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-01-31 16:15:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:45,222 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-01-31 16:15:45,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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:15:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-01-31 16:15:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:15:45,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:45,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:45,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:15:45,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2137589877, now seen corresponding path program 1 times [2022-01-31 16:15:45,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:45,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212705132] [2022-01-31 16:15:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:45,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,370 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:45,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:45,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212705132] [2022-01-31 16:15:45,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212705132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:45,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:45,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:45,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281104730] [2022-01-31 16:15:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:45,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:45,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:45,372 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 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:15:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:45,894 INFO L93 Difference]: Finished difference Result 310 states and 408 transitions. [2022-01-31 16:15:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 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 47 [2022-01-31 16:15:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:45,897 INFO L225 Difference]: With dead ends: 310 [2022-01-31 16:15:45,897 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 16:15:45,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:45,898 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 432 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:45,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 403 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 16:15:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 16:15:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-01-31 16:15:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-31 16:15:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-01-31 16:15:45,901 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-01-31 16:15:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:45,901 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-01-31 16:15:45,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 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:15:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-01-31 16:15:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:15:45,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:45,902 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:45,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:15:45,903 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:45,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1910683918, now seen corresponding path program 1 times [2022-01-31 16:15:45,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:45,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329334098] [2022-01-31 16:15:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:45,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 16:15:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 16:15:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,067 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:46,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:46,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329334098] [2022-01-31 16:15:46,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329334098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:46,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:46,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:46,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507608533] [2022-01-31 16:15:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:46,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:46,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:46,069 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:46,248 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-01-31 16:15:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:46,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-01-31 16:15:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:46,249 INFO L225 Difference]: With dead ends: 100 [2022-01-31 16:15:46,249 INFO L226 Difference]: Without dead ends: 100 [2022-01-31 16:15:46,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:46,250 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:46,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 208 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-31 16:15:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-01-31 16:15:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-31 16:15:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-01-31 16:15:46,253 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-01-31 16:15:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:46,253 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-01-31 16:15:46,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-01-31 16:15:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:15:46,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:46,254 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] [2022-01-31 16:15:46,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:15:46,254 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash -948674633, now seen corresponding path program 1 times [2022-01-31 16:15:46,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:46,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958905692] [2022-01-31 16:15:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:46,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,427 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:46,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:46,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958905692] [2022-01-31 16:15:46,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958905692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:46,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:46,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:46,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101650918] [2022-01-31 16:15:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:46,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:46,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:46,429 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:46,594 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-01-31 16:15:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-01-31 16:15:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:46,595 INFO L225 Difference]: With dead ends: 118 [2022-01-31 16:15:46,595 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 16:15:46,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:46,596 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:46,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 308 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 16:15:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-01-31 16:15:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-01-31 16:15:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-01-31 16:15:46,599 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-01-31 16:15:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:46,600 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-01-31 16:15:46,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-01-31 16:15:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:15:46,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:46,601 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] [2022-01-31 16:15:46,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:15:46,601 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1641862871, now seen corresponding path program 1 times [2022-01-31 16:15:46,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:46,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591524136] [2022-01-31 16:15:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:46,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:46,784 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:46,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591524136] [2022-01-31 16:15:46,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591524136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:46,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:46,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:46,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431276717] [2022-01-31 16:15:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:46,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:46,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:46,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:46,786 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:46,998 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-01-31 16:15:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:46,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-01-31 16:15:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,000 INFO L225 Difference]: With dead ends: 109 [2022-01-31 16:15:47,000 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 16:15:47,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:47,001 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 305 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 16:15:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-01-31 16:15:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-01-31 16:15:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-01-31 16:15:47,004 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-01-31 16:15:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:47,004 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-01-31 16:15:47,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-01-31 16:15:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:47,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:47,005 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:47,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:15:47,006 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1083966817, now seen corresponding path program 1 times [2022-01-31 16:15:47,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:47,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280068536] [2022-01-31 16:15:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:47,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:47,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:47,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280068536] [2022-01-31 16:15:47,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280068536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:47,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:47,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:15:47,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169890461] [2022-01-31 16:15:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:47,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:15:47,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:15:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:15:47,157 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:47,369 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2022-01-31 16:15:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-01-31 16:15:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,371 INFO L225 Difference]: With dead ends: 196 [2022-01-31 16:15:47,371 INFO L226 Difference]: Without dead ends: 196 [2022-01-31 16:15:47,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:47,372 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 183 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 208 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-31 16:15:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2022-01-31 16:15:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 144 states have (on average 1.1875) internal successors, (171), 146 states have internal predecessors, (171), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (18), 17 states have call predecessors, (18), 14 states have call successors, (18) [2022-01-31 16:15:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2022-01-31 16:15:47,377 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 58 [2022-01-31 16:15:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:47,377 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2022-01-31 16:15:47,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2022-01-31 16:15:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:47,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:47,378 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:47,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:15:47,378 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1971470498, now seen corresponding path program 1 times [2022-01-31 16:15:47,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:47,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813582070] [2022-01-31 16:15:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:47,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,553 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:47,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:47,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813582070] [2022-01-31 16:15:47,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813582070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:47,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:47,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:47,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257563492] [2022-01-31 16:15:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:47,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:47,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:47,555 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:47,676 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2022-01-31 16:15:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 16:15:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,677 INFO L225 Difference]: With dead ends: 172 [2022-01-31 16:15:47,677 INFO L226 Difference]: Without dead ends: 172 [2022-01-31 16:15:47,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:47,678 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 256 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-31 16:15:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-01-31 16:15:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 134 states have internal predecessors, (153), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (18), 17 states have call predecessors, (18), 14 states have call successors, (18) [2022-01-31 16:15:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2022-01-31 16:15:47,683 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 58 [2022-01-31 16:15:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:47,683 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2022-01-31 16:15:47,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2022-01-31 16:15:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 16:15:47,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:47,684 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:47,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:15:47,684 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2034770721, now seen corresponding path program 1 times [2022-01-31 16:15:47,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:47,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250837216] [2022-01-31 16:15:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:47,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:47,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:47,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250837216] [2022-01-31 16:15:47,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250837216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:47,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:47,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:47,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692634089] [2022-01-31 16:15:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:47,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:47,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:47,904 INFO L87 Difference]: Start difference. First operand 172 states and 192 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,217 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-01-31 16:15:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-01-31 16:15:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,218 INFO L225 Difference]: With dead ends: 160 [2022-01-31 16:15:48,218 INFO L226 Difference]: Without dead ends: 156 [2022-01-31 16:15:48,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:48,219 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 144 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 16:15:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-31 16:15:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-01-31 16:15:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 118 states have (on average 1.1440677966101696) internal successors, (135), 120 states have internal predecessors, (135), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 16:15:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-01-31 16:15:48,223 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 62 [2022-01-31 16:15:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,224 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-01-31 16:15:48,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-01-31 16:15:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:15:48,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:48,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:15:48,225 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1057027574, now seen corresponding path program 1 times [2022-01-31 16:15:48,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213801523] [2022-01-31 16:15:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:48,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213801523] [2022-01-31 16:15:48,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213801523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:48,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625986633] [2022-01-31 16:15:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:48,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:48,367 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,480 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2022-01-31 16:15:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:15:48,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-01-31 16:15:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,482 INFO L225 Difference]: With dead ends: 168 [2022-01-31 16:15:48,482 INFO L226 Difference]: Without dead ends: 168 [2022-01-31 16:15:48,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:48,482 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 103 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 207 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-31 16:15:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-01-31 16:15:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 126 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 16:15:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-01-31 16:15:48,487 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 64 [2022-01-31 16:15:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,487 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-01-31 16:15:48,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-01-31 16:15:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:15:48,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:48,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:15:48,488 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 763624567, now seen corresponding path program 1 times [2022-01-31 16:15:48,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173499291] [2022-01-31 16:15:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,630 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:48,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173499291] [2022-01-31 16:15:48,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173499291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:48,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49987661] [2022-01-31 16:15:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:48,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:48,631 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:48,820 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-01-31 16:15:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-01-31 16:15:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:48,822 INFO L225 Difference]: With dead ends: 179 [2022-01-31 16:15:48,822 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 16:15:48,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:48,822 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:48,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 215 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 16:15:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2022-01-31 16:15:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.125) internal successors, (144), 130 states have internal predecessors, (144), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 16:15:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-01-31 16:15:48,826 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 64 [2022-01-31 16:15:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,827 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-01-31 16:15:48,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-01-31 16:15:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 16:15:48,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:15:48,828 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1206614856, now seen corresponding path program 1 times [2022-01-31 16:15:48,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359607756] [2022-01-31 16:15:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,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:15:48,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359607756] [2022-01-31 16:15:48,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359607756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:48,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229044212] [2022-01-31 16:15:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:48,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:48,992 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:49,180 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2022-01-31 16:15:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-01-31 16:15:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:49,181 INFO L225 Difference]: With dead ends: 175 [2022-01-31 16:15:49,181 INFO L226 Difference]: Without dead ends: 175 [2022-01-31 16:15:49,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:49,182 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 87 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:49,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 337 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 16:15:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-31 16:15:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2022-01-31 16:15:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.109375) internal successors, (142), 130 states have internal predecessors, (142), 21 states have call successors, (21), 20 states have call predecessors, (21), 16 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 16:15:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-01-31 16:15:49,186 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 64 [2022-01-31 16:15:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-01-31 16:15:49,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-01-31 16:15:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 16:15:49,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:49,187 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] [2022-01-31 16:15:49,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:15:49,187 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2128246060, now seen corresponding path program 1 times [2022-01-31 16:15:49,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:49,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725366449] [2022-01-31 16:15:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:49,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,388 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:49,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725366449] [2022-01-31 16:15:49,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725366449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:49,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:49,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:49,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356170075] [2022-01-31 16:15:49,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:49,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:49,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:49,389 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:49,763 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2022-01-31 16:15:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-31 16:15:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:49,764 INFO L225 Difference]: With dead ends: 163 [2022-01-31 16:15:49,764 INFO L226 Difference]: Without dead ends: 144 [2022-01-31 16:15:49,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:49,765 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 205 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:49,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 154 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-31 16:15:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-01-31 16:15:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.091743119266055) internal successors, (119), 110 states have internal predecessors, (119), 20 states have call successors, (20), 19 states have call predecessors, (20), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 16:15:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-01-31 16:15:49,768 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 65 [2022-01-31 16:15:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:49,769 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-01-31 16:15:49,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-01-31 16:15:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 16:15:49,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:49,770 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] [2022-01-31 16:15:49,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:15:49,770 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1266450091, now seen corresponding path program 1 times [2022-01-31 16:15:49,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:49,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292022011] [2022-01-31 16:15:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:49,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:49,920 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:49,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:49,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292022011] [2022-01-31 16:15:49,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292022011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:49,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:49,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:49,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77044401] [2022-01-31 16:15:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:49,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:49,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:49,922 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:50,063 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2022-01-31 16:15:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:50,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-31 16:15:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:50,065 INFO L225 Difference]: With dead ends: 139 [2022-01-31 16:15:50,065 INFO L226 Difference]: Without dead ends: 137 [2022-01-31 16:15:50,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:50,065 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:50,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 155 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-31 16:15:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-01-31 16:15:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 16:15:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2022-01-31 16:15:50,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 65 [2022-01-31 16:15:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:50,069 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2022-01-31 16:15:50,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-01-31 16:15:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 16:15:50,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:50,070 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] [2022-01-31 16:15:50,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:15:50,070 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash 79966819, now seen corresponding path program 1 times [2022-01-31 16:15:50,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:50,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614343347] [2022-01-31 16:15:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:50,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,259 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:50,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614343347] [2022-01-31 16:15:50,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614343347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:50,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:50,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:50,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041229796] [2022-01-31 16:15:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:50,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:50,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:50,261 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:50,430 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-01-31 16:15:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-01-31 16:15:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:50,431 INFO L225 Difference]: With dead ends: 137 [2022-01-31 16:15:50,431 INFO L226 Difference]: Without dead ends: 137 [2022-01-31 16:15:50,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:50,432 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:50,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 260 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 16:15:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-31 16:15:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-01-31 16:15:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 16:15:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-01-31 16:15:50,435 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 65 [2022-01-31 16:15:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:50,435 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-01-31 16:15:50,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-01-31 16:15:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 16:15:50,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:50,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] [2022-01-31 16:15:50,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:15:50,437 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash -117181948, now seen corresponding path program 1 times [2022-01-31 16:15:50,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:50,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926795958] [2022-01-31 16:15:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:50,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 16:15:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 16:15:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:50,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926795958] [2022-01-31 16:15:50,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926795958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:50,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:50,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:50,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067127805] [2022-01-31 16:15:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:50,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:50,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:50,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:50,591 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:15:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:50,748 INFO L93 Difference]: Finished difference Result 108 states and 107 transitions. [2022-01-31 16:15:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:50,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-01-31 16:15:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:50,750 INFO L225 Difference]: With dead ends: 108 [2022-01-31 16:15:50,750 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 16:15:50,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:50,751 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:50,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 186 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 16:15:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 16:15:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 16:15:50,753 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:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 16:15:50,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-01-31 16:15:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:50,753 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 16:15:50,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:15:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 16:15:50,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 16:15:50,756 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:15:50,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:15:50,763 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] [2022-01-31 16:15:50,767 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:15:50,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:15:50 BasicIcfg [2022-01-31 16:15:50,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:15:50,772 INFO L158 Benchmark]: Toolchain (without parser) took 13319.88ms. Allocated memory was 191.9MB in the beginning and 294.6MB in the end (delta: 102.8MB). Free memory was 134.3MB in the beginning and 173.9MB in the end (delta: -39.6MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,772 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:15:50,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.97ms. Allocated memory was 191.9MB in the beginning and 245.4MB in the end (delta: 53.5MB). Free memory was 134.2MB in the beginning and 209.9MB in the end (delta: -75.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,776 INFO L158 Benchmark]: Boogie Preprocessor took 52.88ms. Allocated memory is still 245.4MB. Free memory was 209.4MB in the beginning and 206.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,776 INFO L158 Benchmark]: RCFGBuilder took 698.57ms. Allocated memory is still 245.4MB. Free memory was 206.7MB in the beginning and 172.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,777 INFO L158 Benchmark]: IcfgTransformer took 69.37ms. Allocated memory is still 245.4MB. Free memory was 172.7MB in the beginning and 169.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,777 INFO L158 Benchmark]: TraceAbstraction took 12066.69ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 168.5MB in the beginning and 173.9MB in the end (delta: -5.5MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2022-01-31 16:15:50,780 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 191.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.97ms. Allocated memory was 191.9MB in the beginning and 245.4MB in the end (delta: 53.5MB). Free memory was 134.2MB in the beginning and 209.9MB in the end (delta: -75.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.88ms. Allocated memory is still 245.4MB. Free memory was 209.4MB in the beginning and 206.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 698.57ms. Allocated memory is still 245.4MB. Free memory was 206.7MB in the beginning and 172.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * IcfgTransformer took 69.37ms. Allocated memory is still 245.4MB. Free memory was 172.7MB in the beginning and 169.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 12066.69ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 168.5MB in the beginning and 173.9MB in the end (delta: -5.5MB). Peak memory consumption was 44.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: 1013]: 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 18 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5226 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5209 mSDsluCounter, 6671 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3495 mSDsCounter, 1267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6357 IncrementalHoareTripleChecker+Invalid, 7624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1267 mSolverCounterUnsat, 3176 mSDtfsCounter, 6357 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 5192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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:50,816 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...