/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:25:53,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:25:53,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:25:53,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:25:53,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:25:53,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:25:53,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:25:53,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:25:53,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:25:53,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:25:53,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:25:53,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:25:53,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:25:53,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:25:53,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:25:53,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:25:53,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:25:53,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:25:53,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:25:53,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:25:53,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:25:53,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:25:53,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:25:53,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:25:53,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:25:53,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:25:53,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:25:53,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:25:53,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:25:53,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:25:53,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:25:53,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:25:53,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:25:53,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:25:53,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:25:53,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:25:53,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:25:53,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:25:53,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:25:53,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:25:53,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:25:53,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:25:53,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:25:53,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:25:53,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:25:53,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:25:53,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:25:53,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:25:53,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:25:53,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:25:53,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:25:53,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:25:53,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:25:53,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:25:53,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:25:53,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:25:53,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:25:53,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-09 23:25:53,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:25:53,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:25:53,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:25:53,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:25:53,327 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:25:53,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-01-09 23:25:53,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4b9889c/81831af9d25948a7a15033ce12a00ae2/FLAG1a0779e66 [2022-01-09 23:25:53,706 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:25:53,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-01-09 23:25:53,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4b9889c/81831af9d25948a7a15033ce12a00ae2/FLAG1a0779e66 [2022-01-09 23:25:54,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4b9889c/81831af9d25948a7a15033ce12a00ae2 [2022-01-09 23:25:54,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:25:54,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:25:54,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:25:54,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:25:54,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:25:54,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1648d6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54, skipping insertion in model container [2022-01-09 23:25:54,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:25:54,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:25:54,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-01-09 23:25:54,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:25:54,397 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:25:54,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-01-09 23:25:54,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:25:54,487 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:25:54,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54 WrapperNode [2022-01-09 23:25:54,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:25:54,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:25:54,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:25:54,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:25:54,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,557 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-01-09 23:25:54,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:25:54,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:25:54,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:25:54,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:25:54,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:25:54,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:25:54,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:25:54,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:25:54,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (1/1) ... [2022-01-09 23:25:54,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:25:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:25:54,644 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-09 23:25:54,682 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-09 23:25:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:25:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-09 23:25:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-09 23:25:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-09 23:25:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-09 23:25:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-09 23:25:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-09 23:25:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-09 23:25:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-09 23:25:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-01-09 23:25:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-01-09 23:25:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-09 23:25:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-09 23:25:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:25:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-09 23:25:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-09 23:25:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-01-09 23:25:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-01-09 23:25:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-01-09 23:25:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-01-09 23:25:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:25:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:25:54,826 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:25:54,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:25:54,830 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:54,880 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-09 23:25:54,880 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-09 23:25:54,881 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:54,896 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-09 23:25:54,896 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-09 23:25:54,925 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:54,929 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:54,938 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:55,227 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-01-09 23:25:55,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-01-09 23:25:55,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-09 23:25:55,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-09 23:25:55,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-01-09 23:25:55,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-01-09 23:25:55,229 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:25:55,255 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-09 23:25:55,255 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-09 23:25:55,291 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:25:55,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:25:55,297 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 23:25:55,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:25:55 BoogieIcfgContainer [2022-01-09 23:25:55,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:25:55,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:25:55,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:25:55,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:25:55,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:25:54" (1/3) ... [2022-01-09 23:25:55,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b0bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:25:55, skipping insertion in model container [2022-01-09 23:25:55,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:25:54" (2/3) ... [2022-01-09 23:25:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1b0bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:25:55, skipping insertion in model container [2022-01-09 23:25:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:25:55" (3/3) ... [2022-01-09 23:25:55,308 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-01-09 23:25:55,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:25:55,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:25:55,354 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:25:55,360 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-09 23:25:55,360 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:25:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-01-09 23:25:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-09 23:25:55,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:55,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:55,394 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2022-01-09 23:25:55,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:55,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835936022] [2022-01-09 23:25:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:55,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,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-09 23:25:55,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:55,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835936022] [2022-01-09 23:25:55,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835936022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:55,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:55,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:55,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242803976] [2022-01-09 23:25:55,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:55,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:55,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:55,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:55,585 INFO L87 Difference]: Start difference. First operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:55,731 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2022-01-09 23:25:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:55,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-09 23:25:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:55,747 INFO L225 Difference]: With dead ends: 449 [2022-01-09 23:25:55,747 INFO L226 Difference]: Without dead ends: 236 [2022-01-09 23:25:55,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:55,756 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:55,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-09 23:25:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-01-09 23:25:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 198 states have internal predecessors, (258), 44 states have call successors, (44), 9 states have call predecessors, (44), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-01-09 23:25:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2022-01-09 23:25:55,818 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2022-01-09 23:25:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:55,818 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2022-01-09 23:25:55,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2022-01-09 23:25:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-09 23:25:55,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:55,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:55,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:25:55,822 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2022-01-09 23:25:55,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:55,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852878070] [2022-01-09 23:25:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:55,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:55,887 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-09 23:25:55,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852878070] [2022-01-09 23:25:55,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852878070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:55,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:55,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:55,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445582738] [2022-01-09 23:25:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:55,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:55,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:55,894 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,034 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2022-01-09 23:25:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-09 23:25:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,038 INFO L225 Difference]: With dead ends: 536 [2022-01-09 23:25:56,039 INFO L226 Difference]: Without dead ends: 377 [2022-01-09 23:25:56,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:56,043 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-09 23:25:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2022-01-09 23:25:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 291 states have internal predecessors, (392), 59 states have call successors, (59), 16 states have call predecessors, (59), 14 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2022-01-09 23:25:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-01-09 23:25:56,074 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2022-01-09 23:25:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,075 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-01-09 23:25:56,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-01-09 23:25:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-09 23:25:56,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,076 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-09 23:25:56,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:25:56,076 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2022-01-09 23:25:56,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637497966] [2022-01-09 23:25:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,127 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-09 23:25:56,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:56,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637497966] [2022-01-09 23:25:56,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637497966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:56,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:56,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:56,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534396922] [2022-01-09 23:25:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:56,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:56,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:56,129 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,155 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2022-01-09 23:25:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:56,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-09 23:25:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,158 INFO L225 Difference]: With dead ends: 823 [2022-01-09 23:25:56,159 INFO L226 Difference]: Without dead ends: 550 [2022-01-09 23:25:56,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:56,160 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-01-09 23:25:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2022-01-09 23:25:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 411 states have (on average 1.389294403892944) internal successors, (571), 418 states have internal predecessors, (571), 84 states have call successors, (84), 24 states have call predecessors, (84), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-01-09 23:25:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2022-01-09 23:25:56,191 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2022-01-09 23:25:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,191 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2022-01-09 23:25:56,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2022-01-09 23:25:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-09 23:25:56,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,192 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] [2022-01-09 23:25:56,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 23:25:56,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2022-01-09 23:25:56,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367636652] [2022-01-09 23:25:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,245 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-09 23:25:56,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:56,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367636652] [2022-01-09 23:25:56,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367636652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:56,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:56,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:56,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631899819] [2022-01-09 23:25:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:56,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:56,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:56,247 INFO L87 Difference]: Start difference. First operand 519 states and 772 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,302 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2022-01-09 23:25:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-09 23:25:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,305 INFO L225 Difference]: With dead ends: 534 [2022-01-09 23:25:56,305 INFO L226 Difference]: Without dead ends: 530 [2022-01-09 23:25:56,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:56,306 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-01-09 23:25:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2022-01-09 23:25:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 422 states have (on average 1.386255924170616) internal successors, (585), 427 states have internal predecessors, (585), 83 states have call successors, (83), 25 states have call predecessors, (83), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-01-09 23:25:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2022-01-09 23:25:56,325 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2022-01-09 23:25:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,325 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2022-01-09 23:25:56,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2022-01-09 23:25:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-09 23:25:56,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,326 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] [2022-01-09 23:25:56,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 23:25:56,326 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2022-01-09 23:25:56,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736920244] [2022-01-09 23:25:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-09 23:25:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,453 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-09 23:25:56,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736920244] [2022-01-09 23:25:56,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736920244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:56,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:56,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:56,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659798886] [2022-01-09 23:25:56,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:56,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:56,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:56,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:56,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:56,455 INFO L87 Difference]: Start difference. First operand 529 states and 785 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:56,759 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2022-01-09 23:25:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:56,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-01-09 23:25:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:56,764 INFO L225 Difference]: With dead ends: 582 [2022-01-09 23:25:56,764 INFO L226 Difference]: Without dead ends: 571 [2022-01-09 23:25:56,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:56,769 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 410 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:56,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-01-09 23:25:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-01-09 23:25:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.3803131991051454) internal successors, (617), 454 states have internal predecessors, (617), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-01-09 23:25:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2022-01-09 23:25:56,801 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2022-01-09 23:25:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:56,802 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2022-01-09 23:25:56,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2022-01-09 23:25:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:25:56,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:56,805 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-09 23:25:56,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 23:25:56,805 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2022-01-09 23:25:56,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:56,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125323853] [2022-01-09 23:25:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:56,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-09 23:25:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:56,911 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-09 23:25:56,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125323853] [2022-01-09 23:25:56,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125323853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:56,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:56,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:56,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114862040] [2022-01-09 23:25:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:56,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:56,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:56,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:56,956 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,220 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2022-01-09 23:25:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:25:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-01-09 23:25:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,223 INFO L225 Difference]: With dead ends: 579 [2022-01-09 23:25:57,223 INFO L226 Difference]: Without dead ends: 571 [2022-01-09 23:25:57,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:57,224 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 408 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-01-09 23:25:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-01-09 23:25:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.378076062639821) internal successors, (616), 454 states have internal predecessors, (616), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-01-09 23:25:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2022-01-09 23:25:57,241 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2022-01-09 23:25:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:57,242 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2022-01-09 23:25:57,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2022-01-09 23:25:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-09 23:25:57,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:57,243 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] [2022-01-09 23:25:57,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 23:25:57,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2022-01-09 23:25:57,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951694741] [2022-01-09 23:25:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:57,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-09 23:25:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,265 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-09 23:25:57,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951694741] [2022-01-09 23:25:57,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951694741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:57,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026882951] [2022-01-09 23:25:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:57,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:57,267 INFO L87 Difference]: Start difference. First operand 556 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,436 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2022-01-09 23:25:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:57,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-01-09 23:25:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,440 INFO L225 Difference]: With dead ends: 1018 [2022-01-09 23:25:57,440 INFO L226 Difference]: Without dead ends: 989 [2022-01-09 23:25:57,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:57,441 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 417 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 772 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-01-09 23:25:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2022-01-09 23:25:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 766 states have internal predecessors, (1056), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-01-09 23:25:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2022-01-09 23:25:57,471 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2022-01-09 23:25:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:57,472 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2022-01-09 23:25:57,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2022-01-09 23:25:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-09 23:25:57,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:57,473 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] [2022-01-09 23:25:57,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 23:25:57,473 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2022-01-09 23:25:57,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:57,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34410542] [2022-01-09 23:25:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:57,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-09 23:25:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,518 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-09 23:25:57,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34410542] [2022-01-09 23:25:57,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34410542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:25:57,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803176658] [2022-01-09 23:25:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:25:57,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:25:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:57,520 INFO L87 Difference]: Start difference. First operand 949 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,683 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2022-01-09 23:25:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-01-09 23:25:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,688 INFO L225 Difference]: With dead ends: 985 [2022-01-09 23:25:57,688 INFO L226 Difference]: Without dead ends: 966 [2022-01-09 23:25:57,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:57,689 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-09 23:25:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2022-01-09 23:25:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 756 states have (on average 1.3915343915343916) internal successors, (1052), 763 states have internal predecessors, (1052), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2022-01-09 23:25:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2022-01-09 23:25:57,724 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2022-01-09 23:25:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:57,725 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2022-01-09 23:25:57,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2022-01-09 23:25:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:57,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:57,726 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] [2022-01-09 23:25:57,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 23:25:57,726 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2022-01-09 23:25:57,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:57,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899275109] [2022-01-09 23:25:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:57,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,761 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-09 23:25:57,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899275109] [2022-01-09 23:25:57,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899275109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:57,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129004860] [2022-01-09 23:25:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:57,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:57,763 INFO L87 Difference]: Start difference. First operand 945 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,786 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2022-01-09 23:25:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,789 INFO L225 Difference]: With dead ends: 1334 [2022-01-09 23:25:57,789 INFO L226 Difference]: Without dead ends: 510 [2022-01-09 23:25:57,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:57,794 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-01-09 23:25:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-01-09 23:25:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 408 states have (on average 1.3553921568627452) internal successors, (553), 414 states have internal predecessors, (553), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (123), 73 states have call predecessors, (123), 71 states have call successors, (123) [2022-01-09 23:25:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2022-01-09 23:25:57,813 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2022-01-09 23:25:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:57,814 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2022-01-09 23:25:57,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2022-01-09 23:25:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:57,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:57,814 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] [2022-01-09 23:25:57,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-09 23:25:57,815 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2022-01-09 23:25:57,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:57,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249827884] [2022-01-09 23:25:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:57,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:25:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:57,869 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-09 23:25:57,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:57,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249827884] [2022-01-09 23:25:57,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249827884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:57,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:57,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:57,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836479937] [2022-01-09 23:25:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:57,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:57,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:57,871 INFO L87 Difference]: Start difference. First operand 510 states and 754 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:57,992 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2022-01-09 23:25:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:25:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-09 23:25:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:57,995 INFO L225 Difference]: With dead ends: 553 [2022-01-09 23:25:57,996 INFO L226 Difference]: Without dead ends: 519 [2022-01-09 23:25:57,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:25:57,997 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:57,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1167 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-09 23:25:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2022-01-09 23:25:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 77 states have call successors, (77), 23 states have call predecessors, (77), 23 states have return successors, (122), 72 states have call predecessors, (122), 70 states have call successors, (122) [2022-01-09 23:25:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2022-01-09 23:25:58,017 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2022-01-09 23:25:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:58,017 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2022-01-09 23:25:58,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2022-01-09 23:25:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:58,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:58,021 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] [2022-01-09 23:25:58,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-09 23:25:58,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2022-01-09 23:25:58,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:58,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548978781] [2022-01-09 23:25:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-09 23:25:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,066 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-09 23:25:58,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548978781] [2022-01-09 23:25:58,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548978781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:58,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:58,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:58,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362605006] [2022-01-09 23:25:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:58,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:58,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:58,068 INFO L87 Difference]: Start difference. First operand 508 states and 749 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:58,309 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2022-01-09 23:25:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:25:58,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-01-09 23:25:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:58,313 INFO L225 Difference]: With dead ends: 720 [2022-01-09 23:25:58,313 INFO L226 Difference]: Without dead ends: 712 [2022-01-09 23:25:58,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:58,314 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 232 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:58,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-01-09 23:25:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2022-01-09 23:25:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.3516483516483517) internal successors, (615), 461 states have internal predecessors, (615), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-01-09 23:25:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2022-01-09 23:25:58,339 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2022-01-09 23:25:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:58,339 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2022-01-09 23:25:58,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2022-01-09 23:25:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:58,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:58,340 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] [2022-01-09 23:25:58,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-09 23:25:58,340 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2022-01-09 23:25:58,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478876054] [2022-01-09 23:25:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-09 23:25:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,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-09 23:25:58,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:58,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478876054] [2022-01-09 23:25:58,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478876054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:58,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:58,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:25:58,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794261645] [2022-01-09 23:25:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:58,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:25:58,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:25:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:58,390 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:58,610 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2022-01-09 23:25:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:25:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-09 23:25:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:58,612 INFO L225 Difference]: With dead ends: 583 [2022-01-09 23:25:58,612 INFO L226 Difference]: Without dead ends: 579 [2022-01-09 23:25:58,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:25:58,613 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 66 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:58,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-01-09 23:25:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2022-01-09 23:25:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 463 states have (on average 1.349892008639309) internal successors, (625), 469 states have internal predecessors, (625), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-01-09 23:25:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2022-01-09 23:25:58,635 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2022-01-09 23:25:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:58,636 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2022-01-09 23:25:58,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2022-01-09 23:25:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:58,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:58,637 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] [2022-01-09 23:25:58,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-09 23:25:58,638 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2022-01-09 23:25:58,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713942553] [2022-01-09 23:25:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-09 23:25:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:58,701 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-09 23:25:58,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:58,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713942553] [2022-01-09 23:25:58,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713942553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:58,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:58,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:25:58,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910140623] [2022-01-09 23:25:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:58,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:25:58,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:25:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:25:58,703 INFO L87 Difference]: Start difference. First operand 574 states and 851 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:58,911 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2022-01-09 23:25:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:25:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-09 23:25:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:58,914 INFO L225 Difference]: With dead ends: 1065 [2022-01-09 23:25:58,914 INFO L226 Difference]: Without dead ends: 605 [2022-01-09 23:25:58,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:25:58,917 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:58,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 1580 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:25:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-01-09 23:25:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2022-01-09 23:25:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 474 states have (on average 1.3544303797468353) internal successors, (642), 481 states have internal predecessors, (642), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (161), 80 states have call predecessors, (161), 77 states have call successors, (161) [2022-01-09 23:25:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2022-01-09 23:25:58,965 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2022-01-09 23:25:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:58,965 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2022-01-09 23:25:58,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2022-01-09 23:25:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:25:58,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:58,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:58,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-09 23:25:58,966 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2022-01-09 23:25:58,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:58,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190709838] [2022-01-09 23:25:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:58,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,005 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-09 23:25:59,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190709838] [2022-01-09 23:25:59,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190709838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:59,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671055215] [2022-01-09 23:25:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:59,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:59,007 INFO L87 Difference]: Start difference. First operand 586 states and 887 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:59,112 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2022-01-09 23:25:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:25:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:25:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:59,114 INFO L225 Difference]: With dead ends: 610 [2022-01-09 23:25:59,114 INFO L226 Difference]: Without dead ends: 582 [2022-01-09 23:25:59,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:59,115 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 270 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:59,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-01-09 23:25:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-01-09 23:25:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.3525641025641026) internal successors, (633), 476 states have internal predecessors, (633), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (159), 79 states have call predecessors, (159), 77 states have call successors, (159) [2022-01-09 23:25:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2022-01-09 23:25:59,151 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2022-01-09 23:25:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:59,152 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2022-01-09 23:25:59,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2022-01-09 23:25:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:25:59,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:59,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:59,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-09 23:25:59,153 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2022-01-09 23:25:59,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839827817] [2022-01-09 23:25:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:59,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-09 23:25:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:25:59,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839827817] [2022-01-09 23:25:59,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839827817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:25:59,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154586480] [2022-01-09 23:25:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:25:59,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:25:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:25:59,211 INFO L87 Difference]: Start difference. First operand 580 states and 876 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:59,567 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2022-01-09 23:25:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:25:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-01-09 23:25:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:59,573 INFO L225 Difference]: With dead ends: 738 [2022-01-09 23:25:59,573 INFO L226 Difference]: Without dead ends: 721 [2022-01-09 23:25:59,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:25:59,575 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:59,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:25:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-01-09 23:25:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2022-01-09 23:25:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 457 states have (on average 1.3544857768052516) internal successors, (619), 464 states have internal predecessors, (619), 83 states have call successors, (83), 25 states have call predecessors, (83), 26 states have return successors, (140), 78 states have call predecessors, (140), 76 states have call successors, (140) [2022-01-09 23:25:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2022-01-09 23:25:59,607 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2022-01-09 23:25:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:59,607 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2022-01-09 23:25:59,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2022-01-09 23:25:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-09 23:25:59,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:59,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:59,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-09 23:25:59,608 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2022-01-09 23:25:59,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:59,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641412246] [2022-01-09 23:25:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:59,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:25:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,638 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-09 23:25:59,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641412246] [2022-01-09 23:25:59,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641412246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:25:59,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894548312] [2022-01-09 23:25:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:25:59,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:25:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:25:59,639 INFO L87 Difference]: Start difference. First operand 567 states and 842 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:59,810 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2022-01-09 23:25:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:25:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-01-09 23:25:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:59,812 INFO L225 Difference]: With dead ends: 630 [2022-01-09 23:25:59,812 INFO L226 Difference]: Without dead ends: 377 [2022-01-09 23:25:59,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:25:59,813 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 315 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:59,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:25:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-09 23:25:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2022-01-09 23:25:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 302 states have internal predecessors, (384), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-01-09 23:25:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2022-01-09 23:25:59,832 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2022-01-09 23:25:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:59,833 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2022-01-09 23:25:59,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:25:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2022-01-09 23:25:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:59,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:59,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:25:59,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-09 23:25:59,833 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2022-01-09 23:25:59,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:59,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011923921] [2022-01-09 23:25:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:59,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,850 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-09 23:25:59,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011923921] [2022-01-09 23:25:59,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011923921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:25:59,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810376532] [2022-01-09 23:25:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:25:59,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:25:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:59,851 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:25:59,926 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2022-01-09 23:25:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:25:59,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-09 23:25:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:25:59,928 INFO L225 Difference]: With dead ends: 504 [2022-01-09 23:25:59,928 INFO L226 Difference]: Without dead ends: 491 [2022-01-09 23:25:59,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:25:59,929 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:25:59,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 641 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:25:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-01-09 23:25:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2022-01-09 23:25:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 310 states have (on average 1.2903225806451613) internal successors, (400), 317 states have internal predecessors, (400), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (62), 41 states have call predecessors, (62), 40 states have call successors, (62) [2022-01-09 23:25:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2022-01-09 23:25:59,952 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2022-01-09 23:25:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:25:59,952 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2022-01-09 23:25:59,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:25:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2022-01-09 23:25:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:25:59,952 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:25:59,952 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] [2022-01-09 23:25:59,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-09 23:25:59,953 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:25:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:25:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2022-01-09 23:25:59,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:25:59,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851091887] [2022-01-09 23:25:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:25:59,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:25:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:25:59,979 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-09 23:25:59,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:25:59,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851091887] [2022-01-09 23:25:59,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851091887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:25:59,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:25:59,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:25:59,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899037795] [2022-01-09 23:25:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:25:59,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:25:59,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:25:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:25:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:25:59,981 INFO L87 Difference]: Start difference. First operand 375 states and 509 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,074 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2022-01-09 23:26:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:26:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-09 23:26:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,076 INFO L225 Difference]: With dead ends: 387 [2022-01-09 23:26:00,076 INFO L226 Difference]: Without dead ends: 353 [2022-01-09 23:26:00,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:00,077 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 262 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-09 23:26:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-01-09 23:26:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.28125) internal successors, (369), 294 states have internal predecessors, (369), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-01-09 23:26:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2022-01-09 23:26:00,098 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2022-01-09 23:26:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,098 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2022-01-09 23:26:00,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2022-01-09 23:26:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-09 23:26:00,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,099 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] [2022-01-09 23:26:00,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-09 23:26:00,099 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2022-01-09 23:26:00,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242023482] [2022-01-09 23:26:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,137 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-09 23:26:00,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242023482] [2022-01-09 23:26:00,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242023482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:00,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335840694] [2022-01-09 23:26:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:00,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:00,138 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,345 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2022-01-09 23:26:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-01-09 23:26:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,347 INFO L225 Difference]: With dead ends: 355 [2022-01-09 23:26:00,347 INFO L226 Difference]: Without dead ends: 324 [2022-01-09 23:26:00,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:00,347 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-01-09 23:26:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-01-09 23:26:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 269 states have internal predecessors, (339), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-01-09 23:26:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2022-01-09 23:26:00,364 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2022-01-09 23:26:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,364 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2022-01-09 23:26:00,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2022-01-09 23:26:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:26:00,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:00,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-09 23:26:00,365 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2022-01-09 23:26:00,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577462322] [2022-01-09 23:26:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,422 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-09 23:26:00,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577462322] [2022-01-09 23:26:00,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577462322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:00,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700025587] [2022-01-09 23:26:00,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:00,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:00,424 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,489 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2022-01-09 23:26:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-09 23:26:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,490 INFO L225 Difference]: With dead ends: 345 [2022-01-09 23:26:00,490 INFO L226 Difference]: Without dead ends: 323 [2022-01-09 23:26:00,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:00,491 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 43 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-01-09 23:26:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-01-09 23:26:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 262 states have (on average 1.286259541984733) internal successors, (337), 268 states have internal predecessors, (337), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-01-09 23:26:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2022-01-09 23:26:00,507 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2022-01-09 23:26:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,507 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2022-01-09 23:26:00,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2022-01-09 23:26:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-09 23:26:00,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,508 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-09 23:26:00,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-09 23:26:00,508 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2022-01-09 23:26:00,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486723598] [2022-01-09 23:26:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-09 23:26:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,533 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-09 23:26:00,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486723598] [2022-01-09 23:26:00,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486723598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:26:00,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838240538] [2022-01-09 23:26:00,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:26:00,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:26:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:00,534 INFO L87 Difference]: Start difference. First operand 323 states and 442 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,652 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2022-01-09 23:26:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:26:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-01-09 23:26:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,653 INFO L225 Difference]: With dead ends: 352 [2022-01-09 23:26:00,653 INFO L226 Difference]: Without dead ends: 322 [2022-01-09 23:26:00,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:00,654 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 79 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1067 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-09 23:26:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2022-01-09 23:26:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 255 states have internal predecessors, (322), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-01-09 23:26:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2022-01-09 23:26:00,671 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2022-01-09 23:26:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,672 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2022-01-09 23:26:00,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2022-01-09 23:26:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-09 23:26:00,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,672 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] [2022-01-09 23:26:00,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-09 23:26:00,672 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2022-01-09 23:26:00,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942779671] [2022-01-09 23:26:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,717 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-09 23:26:00,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942779671] [2022-01-09 23:26:00,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942779671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 23:26:00,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086805224] [2022-01-09 23:26:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:26:00,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:26:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:00,718 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:00,791 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2022-01-09 23:26:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:26:00,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-09 23:26:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:00,792 INFO L225 Difference]: With dead ends: 323 [2022-01-09 23:26:00,792 INFO L226 Difference]: Without dead ends: 319 [2022-01-09 23:26:00,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:00,798 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 46 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:00,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-01-09 23:26:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-01-09 23:26:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.2890625) internal successors, (330), 262 states have internal predecessors, (330), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-01-09 23:26:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2022-01-09 23:26:00,816 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2022-01-09 23:26:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:00,816 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2022-01-09 23:26:00,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2022-01-09 23:26:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-09 23:26:00,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:00,817 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] [2022-01-09 23:26:00,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-09 23:26:00,817 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2022-01-09 23:26:00,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660916596] [2022-01-09 23:26:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:00,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:00,843 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-09 23:26:00,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:00,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660916596] [2022-01-09 23:26:00,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660916596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:00,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:00,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:26:00,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663803974] [2022-01-09 23:26:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:00,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:26:00,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:00,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:26:00,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:26:00,844 INFO L87 Difference]: Start difference. First operand 315 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:01,010 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2022-01-09 23:26:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:26:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-09 23:26:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:01,012 INFO L225 Difference]: With dead ends: 431 [2022-01-09 23:26:01,012 INFO L226 Difference]: Without dead ends: 402 [2022-01-09 23:26:01,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:01,013 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 345 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:01,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 501 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-01-09 23:26:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-01-09 23:26:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 239 states have internal predecessors, (303), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-01-09 23:26:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2022-01-09 23:26:01,033 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2022-01-09 23:26:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:01,034 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2022-01-09 23:26:01,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2022-01-09 23:26:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-09 23:26:01,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:01,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:01,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-09 23:26:01,035 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2022-01-09 23:26:01,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:01,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788928499] [2022-01-09 23:26:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:01,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-09 23:26:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-09 23:26:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,063 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-09 23:26:01,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788928499] [2022-01-09 23:26:01,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788928499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:01,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875210405] [2022-01-09 23:26:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:01,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:01,064 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:01,193 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2022-01-09 23:26:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-09 23:26:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:01,195 INFO L225 Difference]: With dead ends: 544 [2022-01-09 23:26:01,195 INFO L226 Difference]: Without dead ends: 310 [2022-01-09 23:26:01,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:01,196 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:01,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-01-09 23:26:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2022-01-09 23:26:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-01-09 23:26:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2022-01-09 23:26:01,216 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2022-01-09 23:26:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:01,217 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2022-01-09 23:26:01,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2022-01-09 23:26:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-09 23:26:01,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:01,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:01,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-09 23:26:01,217 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2022-01-09 23:26:01,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:01,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482326687] [2022-01-09 23:26:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:01,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-09 23:26:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,311 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-09 23:26:01,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482326687] [2022-01-09 23:26:01,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482326687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-09 23:26:01,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548385359] [2022-01-09 23:26:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:26:01,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:26:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:01,312 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:01,593 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2022-01-09 23:26:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:26:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-01-09 23:26:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:01,595 INFO L225 Difference]: With dead ends: 333 [2022-01-09 23:26:01,595 INFO L226 Difference]: Without dead ends: 310 [2022-01-09 23:26:01,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:26:01,596 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:01,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1275 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-01-09 23:26:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2022-01-09 23:26:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-01-09 23:26:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2022-01-09 23:26:01,615 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2022-01-09 23:26:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:01,615 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2022-01-09 23:26:01,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2022-01-09 23:26:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:26:01,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:01,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:01,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-09 23:26:01,616 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2022-01-09 23:26:01,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713949448] [2022-01-09 23:26:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:01,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:26:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,674 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-09 23:26:01,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713949448] [2022-01-09 23:26:01,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713949448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 23:26:01,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995825927] [2022-01-09 23:26:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:26:01,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:26:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:26:01,675 INFO L87 Difference]: Start difference. First operand 301 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:01,876 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2022-01-09 23:26:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:26:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-09 23:26:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:01,878 INFO L225 Difference]: With dead ends: 569 [2022-01-09 23:26:01,878 INFO L226 Difference]: Without dead ends: 326 [2022-01-09 23:26:01,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:01,879 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 61 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:01,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 1134 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-01-09 23:26:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2022-01-09 23:26:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 257 states have internal predecessors, (326), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (77), 40 states have call predecessors, (77), 38 states have call successors, (77) [2022-01-09 23:26:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2022-01-09 23:26:01,898 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2022-01-09 23:26:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:01,899 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2022-01-09 23:26:01,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2022-01-09 23:26:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:26:01,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:01,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:01,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-09 23:26:01,900 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2022-01-09 23:26:01,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:01,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452204459] [2022-01-09 23:26:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:01,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-09 23:26:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:01,971 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-09 23:26:01,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452204459] [2022-01-09 23:26:01,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452204459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:01,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:01,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:26:01,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123858106] [2022-01-09 23:26:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:01,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:26:01,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:26:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:01,972 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:02,237 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2022-01-09 23:26:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:26:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-09 23:26:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:02,239 INFO L225 Difference]: With dead ends: 315 [2022-01-09 23:26:02,239 INFO L226 Difference]: Without dead ends: 282 [2022-01-09 23:26:02,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:26:02,240 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 66 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:02,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-01-09 23:26:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-01-09 23:26:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-01-09 23:26:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2022-01-09 23:26:02,256 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2022-01-09 23:26:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:02,256 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2022-01-09 23:26:02,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 23:26:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2022-01-09 23:26:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-09 23:26:02,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:02,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:02,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-09 23:26:02,257 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2022-01-09 23:26:02,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512887993] [2022-01-09 23:26:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:02,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:26:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,287 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-09 23:26:02,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:02,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512887993] [2022-01-09 23:26:02,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512887993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:02,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:02,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:02,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975714216] [2022-01-09 23:26:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:02,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:02,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:02,288 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:02,464 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2022-01-09 23:26:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:26:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-09 23:26:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:02,466 INFO L225 Difference]: With dead ends: 441 [2022-01-09 23:26:02,466 INFO L226 Difference]: Without dead ends: 438 [2022-01-09 23:26:02,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:26:02,467 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 140 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:02,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 793 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-09 23:26:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2022-01-09 23:26:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-01-09 23:26:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2022-01-09 23:26:02,503 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2022-01-09 23:26:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:02,503 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2022-01-09 23:26:02,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2022-01-09 23:26:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-09 23:26:02,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:02,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:02,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-09 23:26:02,504 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2022-01-09 23:26:02,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424690763] [2022-01-09 23:26:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:02,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 23:26:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,542 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-09 23:26:02,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424690763] [2022-01-09 23:26:02,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424690763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:02,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:02,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 23:26:02,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913759625] [2022-01-09 23:26:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:02,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 23:26:02,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 23:26:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:26:02,543 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:02,712 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2022-01-09 23:26:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-09 23:26:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:02,714 INFO L225 Difference]: With dead ends: 658 [2022-01-09 23:26:02,714 INFO L226 Difference]: Without dead ends: 405 [2022-01-09 23:26:02,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:02,716 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:02,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-01-09 23:26:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2022-01-09 23:26:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 297 states have (on average 1.2996632996632997) internal successors, (386), 302 states have internal predecessors, (386), 53 states have call successors, (53), 18 states have call predecessors, (53), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-01-09 23:26:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2022-01-09 23:26:02,740 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2022-01-09 23:26:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:02,740 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2022-01-09 23:26:02,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 23:26:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2022-01-09 23:26:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-09 23:26:02,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:02,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:02,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-09 23:26:02,741 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2022-01-09 23:26:02,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:02,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224899197] [2022-01-09 23:26:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:02,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:02,849 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-09 23:26:02,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:02,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224899197] [2022-01-09 23:26:02,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224899197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:02,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:02,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:26:02,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305295441] [2022-01-09 23:26:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:02,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:26:02,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:26:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:02,851 INFO L87 Difference]: Start difference. First operand 373 states and 535 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:26:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:03,064 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-01-09 23:26:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:26:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-01-09 23:26:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:03,067 INFO L225 Difference]: With dead ends: 691 [2022-01-09 23:26:03,067 INFO L226 Difference]: Without dead ends: 346 [2022-01-09 23:26:03,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:03,068 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:03,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 983 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-01-09 23:26:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-01-09 23:26:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 275 states have internal predecessors, (346), 52 states have call successors, (52), 18 states have call predecessors, (52), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-01-09 23:26:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2022-01-09 23:26:03,125 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2022-01-09 23:26:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:03,125 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2022-01-09 23:26:03,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:26:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2022-01-09 23:26:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-09 23:26:03,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:03,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:03,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-09 23:26:03,127 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2022-01-09 23:26:03,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:03,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548356143] [2022-01-09 23:26:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:03,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,220 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-09 23:26:03,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:03,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548356143] [2022-01-09 23:26:03,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548356143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:03,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:03,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-09 23:26:03,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841433565] [2022-01-09 23:26:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:03,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:26:03,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:26:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:03,222 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:03,514 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2022-01-09 23:26:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 23:26:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-01-09 23:26:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:03,516 INFO L225 Difference]: With dead ends: 659 [2022-01-09 23:26:03,516 INFO L226 Difference]: Without dead ends: 341 [2022-01-09 23:26:03,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:03,518 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 232 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:03,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 839 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-01-09 23:26:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-01-09 23:26:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 271 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-01-09 23:26:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2022-01-09 23:26:03,542 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2022-01-09 23:26:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:03,543 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2022-01-09 23:26:03,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-09 23:26:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2022-01-09 23:26:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-09 23:26:03,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:03,543 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-09 23:26:03,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-09 23:26:03,543 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2022-01-09 23:26:03,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:03,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146944848] [2022-01-09 23:26:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:03,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,599 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-09 23:26:03,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146944848] [2022-01-09 23:26:03,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146944848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:03,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:03,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 23:26:03,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255410902] [2022-01-09 23:26:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:03,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:26:03,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:26:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:03,600 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:03,762 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2022-01-09 23:26:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:26:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-01-09 23:26:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:03,764 INFO L225 Difference]: With dead ends: 666 [2022-01-09 23:26:03,764 INFO L226 Difference]: Without dead ends: 353 [2022-01-09 23:26:03,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:26:03,765 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:03,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 686 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-09 23:26:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2022-01-09 23:26:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.262962962962963) internal successors, (341), 274 states have internal predecessors, (341), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-01-09 23:26:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2022-01-09 23:26:03,790 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2022-01-09 23:26:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:03,790 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2022-01-09 23:26:03,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2022-01-09 23:26:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-09 23:26:03,790 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:03,790 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-09 23:26:03,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-09 23:26:03,791 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2022-01-09 23:26:03,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319350818] [2022-01-09 23:26:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:03,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:03,875 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-09 23:26:03,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:03,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319350818] [2022-01-09 23:26:03,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319350818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:03,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:03,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-09 23:26:03,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309788795] [2022-01-09 23:26:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:03,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:26:03,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:26:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:26:03,876 INFO L87 Difference]: Start difference. First operand 344 states and 484 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:04,154 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2022-01-09 23:26:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 23:26:04,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-01-09 23:26:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:04,156 INFO L225 Difference]: With dead ends: 662 [2022-01-09 23:26:04,156 INFO L226 Difference]: Without dead ends: 347 [2022-01-09 23:26:04,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:04,158 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:04,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 1292 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:26:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-01-09 23:26:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2022-01-09 23:26:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 274 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-01-09 23:26:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-01-09 23:26:04,181 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2022-01-09 23:26:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:04,182 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-01-09 23:26:04,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-09 23:26:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-01-09 23:26:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-09 23:26:04,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:04,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:04,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-09 23:26:04,183 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2022-01-09 23:26:04,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:04,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24823493] [2022-01-09 23:26:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:04,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,257 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-09 23:26:04,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:04,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24823493] [2022-01-09 23:26:04,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24823493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:04,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:04,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-09 23:26:04,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810629150] [2022-01-09 23:26:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:04,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:26:04,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:26:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:26:04,258 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:04,610 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2022-01-09 23:26:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-01-09 23:26:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:04,612 INFO L225 Difference]: With dead ends: 623 [2022-01-09 23:26:04,612 INFO L226 Difference]: Without dead ends: 322 [2022-01-09 23:26:04,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:26:04,613 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:04,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 1228 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:04,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-09 23:26:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2022-01-09 23:26:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 252 states have internal predecessors, (309), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (70), 43 states have call predecessors, (70), 46 states have call successors, (70) [2022-01-09 23:26:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2022-01-09 23:26:04,636 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2022-01-09 23:26:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:04,636 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2022-01-09 23:26:04,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2022-01-09 23:26:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-09 23:26:04,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:04,637 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] [2022-01-09 23:26:04,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-09 23:26:04,637 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2022-01-09 23:26:04,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:04,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732732788] [2022-01-09 23:26:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:04,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:04,778 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-09 23:26:04,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:04,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732732788] [2022-01-09 23:26:04,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732732788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:04,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:04,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-09 23:26:04,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387349001] [2022-01-09 23:26:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:04,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:26:04,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:26:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:04,780 INFO L87 Difference]: Start difference. First operand 314 states and 428 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:05,187 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2022-01-09 23:26:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-09 23:26:05,188 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2022-01-09 23:26:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:05,189 INFO L225 Difference]: With dead ends: 350 [2022-01-09 23:26:05,189 INFO L226 Difference]: Without dead ends: 329 [2022-01-09 23:26:05,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:05,190 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:05,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 2072 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-01-09 23:26:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-01-09 23:26:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-01-09 23:26:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-01-09 23:26:05,210 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2022-01-09 23:26:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:05,210 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-01-09 23:26:05,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-01-09 23:26:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-09 23:26:05,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:05,211 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] [2022-01-09 23:26:05,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-09 23:26:05,211 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2022-01-09 23:26:05,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735856460] [2022-01-09 23:26:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:05,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-09 23:26:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,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-09 23:26:05,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735856460] [2022-01-09 23:26:05,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735856460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:05,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:05,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-09 23:26:05,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703854063] [2022-01-09 23:26:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:05,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:26:05,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:26:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:05,355 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:05,777 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2022-01-09 23:26:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-09 23:26:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2022-01-09 23:26:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:05,779 INFO L225 Difference]: With dead ends: 354 [2022-01-09 23:26:05,780 INFO L226 Difference]: Without dead ends: 333 [2022-01-09 23:26:05,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:05,780 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:05,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 2386 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-01-09 23:26:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2022-01-09 23:26:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-01-09 23:26:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-01-09 23:26:05,806 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2022-01-09 23:26:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:05,806 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-01-09 23:26:05,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-09 23:26:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-01-09 23:26:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-09 23:26:05,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:05,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:05,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-09 23:26:05,807 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2022-01-09 23:26:05,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646110999] [2022-01-09 23:26:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:05,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-09 23:26:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:05,983 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-09 23:26:05,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:05,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646110999] [2022-01-09 23:26:05,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646110999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:05,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:05,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-09 23:26:05,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356123850] [2022-01-09 23:26:05,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:05,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-09 23:26:05,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-09 23:26:05,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:26:05,984 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-09 23:26:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:06,740 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2022-01-09 23:26:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-09 23:26:06,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-01-09 23:26:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:06,742 INFO L225 Difference]: With dead ends: 468 [2022-01-09 23:26:06,742 INFO L226 Difference]: Without dead ends: 429 [2022-01-09 23:26:06,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-01-09 23:26:06,743 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 194 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:06,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 2689 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-09 23:26:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2022-01-09 23:26:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.2626582278481013) internal successors, (399), 327 states have internal predecessors, (399), 76 states have call successors, (76), 18 states have call predecessors, (76), 20 states have return successors, (110), 67 states have call predecessors, (110), 72 states have call successors, (110) [2022-01-09 23:26:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2022-01-09 23:26:06,768 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2022-01-09 23:26:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:06,768 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2022-01-09 23:26:06,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-09 23:26:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2022-01-09 23:26:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:26:06,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:06,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:06,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-09 23:26:06,769 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2022-01-09 23:26:06,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:06,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183248625] [2022-01-09 23:26:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:06,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:06,854 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-09 23:26:06,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183248625] [2022-01-09 23:26:06,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183248625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:06,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:06,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:06,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871464891] [2022-01-09 23:26:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:06,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:06,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:06,855 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-09 23:26:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:07,223 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2022-01-09 23:26:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:26:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-01-09 23:26:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:07,225 INFO L225 Difference]: With dead ends: 809 [2022-01-09 23:26:07,226 INFO L226 Difference]: Without dead ends: 538 [2022-01-09 23:26:07,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-01-09 23:26:07,227 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:07,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-09 23:26:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2022-01-09 23:26:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 397 states have internal predecessors, (485), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (114), 73 states have call predecessors, (114), 75 states have call successors, (114) [2022-01-09 23:26:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2022-01-09 23:26:07,258 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2022-01-09 23:26:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:07,259 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2022-01-09 23:26:07,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-09 23:26:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2022-01-09 23:26:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:26:07,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:07,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:07,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-09 23:26:07,260 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2022-01-09 23:26:07,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:07,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801202599] [2022-01-09 23:26:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:07,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,351 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-09 23:26:07,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:07,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801202599] [2022-01-09 23:26:07,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801202599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:07,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:07,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:07,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447627944] [2022-01-09 23:26:07,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:07,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:07,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:07,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:07,353 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-09 23:26:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:07,803 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2022-01-09 23:26:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-09 23:26:07,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-01-09 23:26:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:07,805 INFO L225 Difference]: With dead ends: 867 [2022-01-09 23:26:07,805 INFO L226 Difference]: Without dead ends: 496 [2022-01-09 23:26:07,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:26:07,807 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 447 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:07,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 714 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-01-09 23:26:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-01-09 23:26:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.248062015503876) internal successors, (483), 397 states have internal predecessors, (483), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (106), 73 states have call predecessors, (106), 75 states have call successors, (106) [2022-01-09 23:26:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2022-01-09 23:26:07,836 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2022-01-09 23:26:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:07,836 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2022-01-09 23:26:07,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-09 23:26:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2022-01-09 23:26:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-09 23:26:07,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:07,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:07,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-09 23:26:07,837 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2022-01-09 23:26:07,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279628383] [2022-01-09 23:26:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:07,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-09 23:26:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:07,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-09 23:26:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:08,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279628383] [2022-01-09 23:26:08,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279628383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:08,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:08,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-09 23:26:08,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374285161] [2022-01-09 23:26:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:08,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-09 23:26:08,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-09 23:26:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:26:08,002 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-09 23:26:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:08,700 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2022-01-09 23:26:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-09 23:26:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2022-01-09 23:26:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:08,712 INFO L225 Difference]: With dead ends: 657 [2022-01-09 23:26:08,713 INFO L226 Difference]: Without dead ends: 610 [2022-01-09 23:26:08,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-01-09 23:26:08,713 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:08,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 2336 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-09 23:26:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-09 23:26:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2022-01-09 23:26:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 385 states have (on average 1.2493506493506494) internal successors, (481), 394 states have internal predecessors, (481), 79 states have call successors, (79), 25 states have call predecessors, (79), 28 states have return successors, (105), 73 states have call predecessors, (105), 75 states have call successors, (105) [2022-01-09 23:26:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2022-01-09 23:26:08,744 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2022-01-09 23:26:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:08,744 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2022-01-09 23:26:08,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-09 23:26:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2022-01-09 23:26:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:26:08,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:08,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:08,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-09 23:26:08,745 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2022-01-09 23:26:08,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:08,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452884374] [2022-01-09 23:26:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:08,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:08,881 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-09 23:26:08,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:08,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452884374] [2022-01-09 23:26:08,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452884374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:08,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:08,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-09 23:26:08,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171364290] [2022-01-09 23:26:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:08,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:26:08,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:08,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:26:08,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:08,883 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-09 23:26:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:09,514 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2022-01-09 23:26:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-09 23:26:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-01-09 23:26:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:09,518 INFO L225 Difference]: With dead ends: 957 [2022-01-09 23:26:09,518 INFO L226 Difference]: Without dead ends: 931 [2022-01-09 23:26:09,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-01-09 23:26:09,519 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 348 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:09,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 2112 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 23:26:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-01-09 23:26:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2022-01-09 23:26:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 473 states have internal predecessors, (562), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (115), 80 states have call predecessors, (115), 81 states have call successors, (115) [2022-01-09 23:26:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2022-01-09 23:26:09,575 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2022-01-09 23:26:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:09,575 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2022-01-09 23:26:09,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-09 23:26:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2022-01-09 23:26:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:26:09,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:09,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:09,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-09 23:26:09,576 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2022-01-09 23:26:09,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545842605] [2022-01-09 23:26:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:09,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-09 23:26:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:09,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:09,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545842605] [2022-01-09 23:26:09,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545842605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:09,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:09,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-09 23:26:09,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124038390] [2022-01-09 23:26:09,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:09,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:26:09,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:26:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:09,699 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-09 23:26:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:10,176 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2022-01-09 23:26:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-09 23:26:10,177 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-01-09 23:26:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:10,180 INFO L225 Difference]: With dead ends: 952 [2022-01-09 23:26:10,180 INFO L226 Difference]: Without dead ends: 918 [2022-01-09 23:26:10,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-01-09 23:26:10,181 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 273 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:10,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 3201 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-01-09 23:26:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2022-01-09 23:26:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2022-01-09 23:26:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2022-01-09 23:26:10,232 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2022-01-09 23:26:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:10,232 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2022-01-09 23:26:10,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-09 23:26:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2022-01-09 23:26:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-09 23:26:10,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:10,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:10,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-09 23:26:10,234 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2022-01-09 23:26:10,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165284574] [2022-01-09 23:26:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:10,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-09 23:26:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:10,390 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-09 23:26:10,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:10,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165284574] [2022-01-09 23:26:10,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165284574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:10,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:10,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-09 23:26:10,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406297241] [2022-01-09 23:26:10,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:10,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:26:10,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:10,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:26:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:10,392 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-09 23:26:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:11,310 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2022-01-09 23:26:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-09 23:26:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-01-09 23:26:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:11,315 INFO L225 Difference]: With dead ends: 932 [2022-01-09 23:26:11,315 INFO L226 Difference]: Without dead ends: 885 [2022-01-09 23:26:11,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-01-09 23:26:11,324 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 531 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:11,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 2123 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-09 23:26:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-01-09 23:26:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2022-01-09 23:26:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2022-01-09 23:26:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2022-01-09 23:26:11,400 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2022-01-09 23:26:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:11,400 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2022-01-09 23:26:11,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-09 23:26:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2022-01-09 23:26:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-09 23:26:11,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:11,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:26:11,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-09 23:26:11,402 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2022-01-09 23:26:11,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362319082] [2022-01-09 23:26:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:11,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 23:26:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-09 23:26:11,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362319082] [2022-01-09 23:26:11,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362319082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:11,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:11,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:11,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928199286] [2022-01-09 23:26:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:11,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:11,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:11,501 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-09 23:26:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:11,936 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2022-01-09 23:26:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2022-01-09 23:26:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:11,941 INFO L225 Difference]: With dead ends: 1692 [2022-01-09 23:26:11,941 INFO L226 Difference]: Without dead ends: 1142 [2022-01-09 23:26:11,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:11,943 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:11,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 1354 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-01-09 23:26:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2022-01-09 23:26:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2022-01-09 23:26:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2022-01-09 23:26:12,006 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2022-01-09 23:26:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:12,006 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2022-01-09 23:26:12,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-09 23:26:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2022-01-09 23:26:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-09 23:26:12,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:12,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:12,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-09 23:26:12,008 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2022-01-09 23:26:12,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952910946] [2022-01-09 23:26:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:12,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-09 23:26:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-09 23:26:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-09 23:26:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:12,150 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-09 23:26:12,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:12,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952910946] [2022-01-09 23:26:12,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952910946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:12,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:12,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-09 23:26:12,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809323741] [2022-01-09 23:26:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:12,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:26:12,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:26:12,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:26:12,151 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-09 23:26:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:13,159 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2022-01-09 23:26:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-09 23:26:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-01-09 23:26:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:13,162 INFO L225 Difference]: With dead ends: 858 [2022-01-09 23:26:13,162 INFO L226 Difference]: Without dead ends: 809 [2022-01-09 23:26:13,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-01-09 23:26:13,163 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:13,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 3028 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-09 23:26:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-01-09 23:26:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2022-01-09 23:26:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2022-01-09 23:26:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2022-01-09 23:26:13,192 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2022-01-09 23:26:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:13,192 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2022-01-09 23:26:13,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-09 23:26:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2022-01-09 23:26:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-09 23:26:13,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:13,193 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:13,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-09 23:26:13,194 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2022-01-09 23:26:13,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583320264] [2022-01-09 23:26:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:13,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 23:26:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-09 23:26:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-09 23:26:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-09 23:26:13,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583320264] [2022-01-09 23:26:13,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583320264] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:26:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701471649] [2022-01-09 23:26:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:13,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:26:13,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:26:13,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:26:13,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:26:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:13,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-09 23:26:13,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:26:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-09 23:26:13,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 23:26:13,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701471649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:13,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 23:26:13,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-01-09 23:26:13,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665335378] [2022-01-09 23:26:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:13,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:26:13,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:26:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:26:13,649 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-09 23:26:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:13,717 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2022-01-09 23:26:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:26:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2022-01-09 23:26:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:13,718 INFO L225 Difference]: With dead ends: 513 [2022-01-09 23:26:13,719 INFO L226 Difference]: Without dead ends: 327 [2022-01-09 23:26:13,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:13,721 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:13,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 720 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-09 23:26:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2022-01-09 23:26:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2022-01-09 23:26:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2022-01-09 23:26:13,753 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2022-01-09 23:26:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:13,753 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2022-01-09 23:26:13,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-09 23:26:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2022-01-09 23:26:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-09 23:26:13,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:13,754 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:13,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 23:26:13,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-01-09 23:26:13,972 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2022-01-09 23:26:13,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:13,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625234392] [2022-01-09 23:26:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:13,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 23:26:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-09 23:26:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-09 23:26:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-09 23:26:14,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625234392] [2022-01-09 23:26:14,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625234392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:14,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:14,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:14,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659780131] [2022-01-09 23:26:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:14,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:14,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:14,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:14,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:14,104 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-09 23:26:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:14,479 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2022-01-09 23:26:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2022-01-09 23:26:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:14,482 INFO L225 Difference]: With dead ends: 534 [2022-01-09 23:26:14,482 INFO L226 Difference]: Without dead ends: 362 [2022-01-09 23:26:14,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:14,483 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:14,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 1066 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-01-09 23:26:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2022-01-09 23:26:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2022-01-09 23:26:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2022-01-09 23:26:14,516 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2022-01-09 23:26:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:14,517 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2022-01-09 23:26:14,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-09 23:26:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2022-01-09 23:26:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-09 23:26:14,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:14,519 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:14,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-09 23:26:14,519 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2022-01-09 23:26:14,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:14,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670557838] [2022-01-09 23:26:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:14,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 23:26:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-09 23:26:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-09 23:26:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-09 23:26:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-09 23:26:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-01-09 23:26:14,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670557838] [2022-01-09 23:26:14,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670557838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:14,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:14,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:14,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642029768] [2022-01-09 23:26:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:14,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:14,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:14,656 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-09 23:26:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:15,012 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2022-01-09 23:26:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:15,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2022-01-09 23:26:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:15,013 INFO L225 Difference]: With dead ends: 384 [2022-01-09 23:26:15,013 INFO L226 Difference]: Without dead ends: 317 [2022-01-09 23:26:15,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:15,014 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 98 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:15,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 909 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-01-09 23:26:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-01-09 23:26:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2022-01-09 23:26:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-01-09 23:26:15,035 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2022-01-09 23:26:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:15,035 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-01-09 23:26:15,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-09 23:26:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-01-09 23:26:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-01-09 23:26:15,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:15,037 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:15,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-09 23:26:15,037 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2022-01-09 23:26:15,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:15,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001262978] [2022-01-09 23:26:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:15,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 23:26:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:26:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 23:26:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 23:26:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-09 23:26:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-09 23:26:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-09 23:26:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-09 23:26:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-09 23:26:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:26:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-01-09 23:26:15,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:15,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001262978] [2022-01-09 23:26:15,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001262978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:15,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:15,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 23:26:15,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611341969] [2022-01-09 23:26:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:15,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:26:15,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:26:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:26:15,199 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-09 23:26:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:15,545 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-01-09 23:26:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:26:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2022-01-09 23:26:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:15,546 INFO L225 Difference]: With dead ends: 223 [2022-01-09 23:26:15,546 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 23:26:15,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:26:15,547 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:15,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 713 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 23:26:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 23:26:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 23:26:15,547 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-09 23:26:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 23:26:15,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-01-09 23:26:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:15,547 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 23:26:15,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-09 23:26:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 23:26:15,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 23:26:15,549 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 23:26:15,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-09 23:26:15,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 23:26:41,930 WARN L228 SmtUtils]: Spent 11.28s on a formula simplification. DAG size of input: 131 DAG size of output: 127 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-09 23:26:54,277 WARN L228 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 130 DAG size of output: 126 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-09 23:27:00,337 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 130 DAG size of output: 126 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)